On the public citation graph

General constraint qualifications in nondifferentiable programming

https://doi.org/10.1007/bf01580871
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-12603-5_5openalex-snapshot
Variations on the Theme of Nonsmooth Analysis: Another Subdifferential
inferredcites →https://doi.org/10.1007/bf00934938openalex-snapshot
On the cones of tangents with applications to mathematical programming
inferredcites →https://doi.org/10.1007/bf01259338openalex-snapshot
Solvability results for sublinear functions and operators
inferredcites →https://doi.org/10.1007/bf01588302openalex-snapshot
On conditions to have bounded multipliers in locally lipschitz programming
inferredcites →https://doi.org/10.1007/bf01588951openalex-snapshot
On optimality conditions in nondifferentiable programming
inferredcites →https://doi.org/10.1007/bf01761497openalex-snapshot
Tangency and differentiation: Some applications of convergence theory
inferredcites →https://doi.org/10.1007/bfb0120990openalex-snapshot
Kuhn-tucker multipliers and nonsmooth programs
inferredcites →https://doi.org/10.1016/0022-1236(78)90030-7openalex-snapshot
Calcul sous-differentiel et optimisation
inferredcites →https://doi.org/10.1016/0305-0548(93)90042-hopenalex-snapshot
Nonlinear programming: theory and algorithms
inferredcites →https://doi.org/10.1057/jors.1979.231openalex-snapshot
Nonlinear Programming -- Theory and Algorithms
inferredcites →https://doi.org/10.1080/01630568708816246openalex-snapshot
On optimality conditions in nonsmooth inequality constrained minimization
inferredcites →https://doi.org/10.1080/02331938708843290openalex-snapshot
Isotone tangent cones and nonsmooth optimization
inferredcites →https://doi.org/10.1080/02331939008843530openalex-snapshot
Upper DSL Approximates and Nonsmooth Optimization
inferredcites →https://doi.org/10.1080/02522667.1989.10698953openalex-snapshot
Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
inferredcites →https://doi.org/10.1090/s0002-9947-1987-0891640-2openalex-snapshot
Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization
inferredcites →https://doi.org/10.1112/plms/s3-39.2.331openalex-snapshot
Directionally Lipschitzian Functions and Subdifferential Calculus
inferredcites →https://doi.org/10.1137/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1137/0317019openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
inferredcites →https://doi.org/10.1137/0320041openalex-snapshot
Tangent Sets’ Calculus and Necessary Conditions for Extremality
inferredcites →https://doi.org/10.1137/0325072openalex-snapshot
Nonsmooth Calculus in Finite Dimensions
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.10.2.361openalex-snapshot
Necessary Conditions for the Bolza Problem
inferredcites →https://doi.org/10.1287/moor.10.4.565openalex-snapshot
Cores of Tangent Cones and Clarke's Tangent Cone
inferredcites →https://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
inferredcites →https://doi.org/10.4153/cjm-1980-020-7openalex-snapshot
Generalized Directional Derivatives and Subgradients of Nonconvex Functions
inferredcites →https://doi.org/10.4153/cjm-1984-008-7openalex-snapshot
Directionally Lipschitzian Mappings on Baire Spaces
inferredcites →https://doi.org/10.4153/cjm-1988-029-6openalex-snapshot
The Quantificational Tangent Cones

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_2openalex-snapshot
On Regularity for Generalized Systems and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-37007-9_3openalex-snapshot
Optimality Conditions and Duality for Multiobjective Programming Involving (C, α, ρ, d) type-I Functions
inferred← citeshttps://doi.org/10.1007/bf00940081openalex-snapshot
Differential stability in non-Lipschitzian optimization
inferred← citeshttps://doi.org/10.1007/bf01581251openalex-snapshot
Convex composite multi-objective nonsmooth programming
inferred← citeshttps://doi.org/10.1007/bf02193099openalex-snapshot
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
inferred← citeshttps://doi.org/10.1007/bf02363856openalex-snapshot
Theorem on an implicit function in quasidifferential calculus
inferred← citeshttps://doi.org/10.1007/s10107-020-01554-6openalex-snapshot
Asymptotic behavior of solutions: An application to stochastic NLP
inferred← citeshttps://doi.org/10.1007/s10898-005-5320-4openalex-snapshot
Optimality Criteria and Duality in Multiobjective Programming Involving Nonsmooth Invex Functions
inferred← citeshttps://doi.org/10.1007/s10957-006-9155-zopenalex-snapshot
Necessary Optimality Conditions in Terms of Convexificators in Lipschitz Optimization
inferred← citeshttps://doi.org/10.1016/s0252-9602(08)60085-5openalex-snapshot
The Tangent cones on constraint qualifications in optimization problems
inferred← citeshttps://doi.org/10.1023/a:1004607615343openalex-snapshot
Constraint Qualifications in Nonsmooth Multiobjective Optimization
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/01630569508816607openalex-snapshot
Fixed point theorem in nonsmooth analysis and its applications
inferred← citeshttps://doi.org/10.1080/02331934.2022.2045987openalex-snapshot
Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
inferred← citeshttps://doi.org/10.1080/02331939208843794openalex-snapshot
On Quasidifferentiable Functions and Non-Differentiable Programming
inferred← citeshttps://doi.org/10.1080/02331939508844032openalex-snapshot
Small convex-valued subdifferentials in mathematical programming
inferred← citeshttps://doi.org/10.1137/0806011openalex-snapshot
Dini Derivatives of the Marginal Function of a Non-Lipschitzian Program
inferred← citeshttps://doi.org/10.23952/jnva.6.2022.2.06openalex-snapshot
Constraint qualifications in nonsmooth optimization: Classification and inter-relations
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.983openalex-snapshot
On constraint qualifications: Motivation, design and inter-relations
inferred← citeshttps://doi.org/10.4134/jkms.2006.43.2.241openalex-snapshot
INVEXITY AS NECESSARY OPTIMALITY CONDITION IN NONSMOOTH PROGRAMS
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.