On the public citation graph
Refinements of necessary optimality conditions in nondifferentiable programming I
0 signed · 101 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00932859openalex-snapshot
Analysis and optimization of Lipschitz continuous mappings
inferredcites →https://doi.org/10.1007/bf01588951openalex-snapshot
On optimality conditions in nondifferentiable programming
inferredcites →https://doi.org/10.1016/0022-247x(67)90139-4openalex-snapshot
On the continuity of the minimum set of a continuous function
inferredcites →https://doi.org/10.1016/0022-247x(67)90163-1openalex-snapshot
The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
inferredcites →https://doi.org/10.1016/0022-247x(69)90153-xopenalex-snapshot
A constructive proof of the Kuhn-Tucker multiplier rule
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6005-4openalex-snapshot
An Algorithmic Approach to Nonlinear Analysis and Optimization
inferredcites →https://doi.org/10.1080/00029890.1973.11993409openalex-snapshot
The Lagrange Multiplier Rule
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
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.2140/pjm.1976.64.97openalex-snapshot
On the inverse function theorem
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.4153/cjm-1977-055-6openalex-snapshot
Inequality Constraints in the Calculus of Variations
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-4613-3285-5_10openalex-snapshot
Approximations to the Clarke Generalized Jacobians and Nonsmooth Least-Squares Minimization
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_1openalex-snapshot
Metric and Topological Tools
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_2openalex-snapshot
Elements of Differential Calculus
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_3openalex-snapshot
Elements of Convex Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_4openalex-snapshot
Elementary and Viscosity Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_5openalex-snapshot
Circa-Subdifferentials, Clarke Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_6openalex-snapshot
Limiting Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-1-4614-4538-8_7openalex-snapshot
Graded Subdifferentials, Ioffe Subdifferentials
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_10openalex-snapshot
Introduction to Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-211-48243-8_5openalex-snapshot
Mathematical Programs with Equilibrium Constraints: Theory and Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-46802-5_16openalex-snapshot
Abstract nonsmooth nonconvex programming
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_15openalex-snapshot
Generalized Subgradients in Mathematical Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_6openalex-snapshot
Lipschitzian Stability in Optimization: The Role of Nonsmooth Analysis
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_1openalex-snapshot
General Optimality Conditions via a Separation Scheme
inferred← citeshttps://doi.org/10.1007/bf00933503openalex-snapshot
Multiplier rules and the separation of convex sets
inferred← citeshttps://doi.org/10.1007/bf00938588openalex-snapshot
Stability and regular points of inequality systems
inferred← citeshttps://doi.org/10.1007/bf00939984openalex-snapshot
Clarke's tangent vectors as tangents to lipschitz continuous curves
inferred← citeshttps://doi.org/10.1007/bf00940078openalex-snapshot
Refinements of necessary conditions for optimality in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf00940086openalex-snapshot
Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
inferred← citeshttps://doi.org/10.1007/bf00968624openalex-snapshot
Generalized differentials of nonsmooth functions, and necessary conditions for an extremum
inferred← citeshttps://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferred← citeshttps://doi.org/10.1007/bf01442169openalex-snapshot
Generalized Hessian matrix and second-order optimality conditions for problems withC 1,1 data
inferred← citeshttps://doi.org/10.1007/bf01580860openalex-snapshot
Approximate subdifferential and metric regularity: The finite-dimensional case
inferred← citeshttps://doi.org/10.1007/bf02831955openalex-snapshot
Global parametric sufficient optimality conditions for discrete minmax fractional programming problems containing generalized (θ, η, ρ)-V-invex functions and arbitrary norms
inferred← citeshttps://doi.org/10.1007/bfb0004503openalex-snapshot
Optimality conditions for discrete nonlinear norm-approximation problems
inferred← citeshttps://doi.org/10.1007/bfb0066254openalex-snapshot
New applications of nonsmooth analysis to nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/bfb0120956openalex-snapshot
Characterizations of the plenary hull of the generalized Jacobian matrix
inferred← citeshttps://doi.org/10.1007/bfb0120958openalex-snapshot
Lagrange multipliers and subderivatives of optimal value functions in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bfb0120985openalex-snapshot
Refinements of necessary optimality conditions in nondifferentiable programming II
inferred← citeshttps://doi.org/10.1007/s00245-026-10487-zopenalex-snapshot
Second-Order Optimality Conditions for Nonsmooth Constrained Optimization with Applications to Bilevel Programming
inferred← citeshttps://doi.org/10.1007/s10898-009-9407-1openalex-snapshot
On a theorem due to Crouzeix and Ferland
inferred← citeshttps://doi.org/10.1007/s10957-004-1180-1openalex-snapshot
Implicit Smoothing and Its Application to Optimization with Piecewise Smooth Equality Constraints1
inferred← citeshttps://doi.org/10.1007/s10957-012-0127-1openalex-snapshot
Asymptotic Analysis of Sample Average Approximation for Stochastic Optimization Problems with Joint Chance Constraints via Conditional Value at Risk and Difference of Convex Functions
inferred← citeshttps://doi.org/10.1007/s10957-018-1241-5openalex-snapshot
Generalized Envelope Theorems: Applications to Dynamic Programming
inferred← citeshttps://doi.org/10.1007/s11075-005-9009-zopenalex-snapshot
An approximate Newton method for non-smooth equations with finite max functions
inferred← citeshttps://doi.org/10.1007/s11590-015-0967-3openalex-snapshot
The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
inferred← citeshttps://doi.org/10.1016/0022-247x(83)90179-8openalex-snapshot
Homeomorphisms and generalized derivatives
inferred← citeshttps://doi.org/10.1016/0362-546x(85)90012-4openalex-snapshot
Extensions of subgradient calculus with applications to optimization
inferred← citeshttps://doi.org/10.1016/0362-546x(89)90010-2openalex-snapshot
Further properties of the regularity of inclusion systems
inferred← citeshttps://doi.org/10.1016/s0022-247x(02)00064-1openalex-snapshot
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
inferred← citeshttps://doi.org/10.1016/s0362-546x(01)00129-8openalex-snapshot
Variational pairs and applications to stability in nonsmooth analysis
inferred← citeshttps://doi.org/10.1017/s0004972700012041openalex-snapshot
On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s0004972700029403openalex-snapshot
On metric regularity of multifunctions
inferred← citeshttps://doi.org/10.1017/s144678870003127xopenalex-snapshot
Generalized differentiability for a class of nondifferentiable operators with applications to nonsmooth optimization
inferred← citeshttps://doi.org/10.1080/00207160.2010.541451openalex-snapshot
An approximate Newton method for solving non-smooth equations with infinite max functions
inferred← citeshttps://doi.org/10.1080/00207178808906202openalex-snapshot
Discrete maximum principle for problems with lipschitzian functions
inferred← citeshttps://doi.org/10.1080/01630563.2010.526408openalex-snapshot
(Φ, ρ)-Invexity in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/01630568608816215openalex-snapshot
Nonsmooth analysis of vector-valued mappings with contributions to nondifferentiable programming
inferred← citeshttps://doi.org/10.1080/01630568708816246openalex-snapshot
On optimality conditions in nonsmooth inequality constrained minimization
inferred← citeshttps://doi.org/10.1080/02331930601120516openalex-snapshot
First order optimality conditions in vector optimization involving stable functions
inferred← citeshttps://doi.org/10.1080/02331934.2019.1647199openalex-snapshot
Homotopy method for solving mathematical programs with bounded box-constrained variational inequalities
inferred← citeshttps://doi.org/10.1080/02331938808843311openalex-snapshot
Regularity, calmness and support principle
inferred← citeshttps://doi.org/10.1080/02331938808843391openalex-snapshot
A covering theorem for set-valued mappings
inferred← citeshttps://doi.org/10.1080/02331939208843850openalex-snapshot
b-Subgradients of the optimal value function in nonlinear programming
inferred← citeshttps://doi.org/10.1080/02331939508844060openalex-snapshot
Optimality conditions for bilevel programming problems
inferred← citeshttps://doi.org/10.1080/02331939508844069openalex-snapshot
Local properties of solutions of nonsmooth variational solutions of nonsmooth variational inequalities
inferred← citeshttps://doi.org/10.1080/02331939808844382openalex-snapshot
Duality for non smooth non linear fractional multiobjective programs via (F,ρ) - convexity
inferred← citeshttps://doi.org/10.1080/02331939908844455openalex-snapshot
Continuous approximations to generalized jacobians
inferred← citeshttps://doi.org/10.1080/02522667.1990.10699019openalex-snapshot
Saddlepoint Problems in Nondifferentiable Programming
inferred← citeshttps://doi.org/10.1080/10556780410001704902openalex-snapshot
𝒱𝒰-smoothness and proximal point results for some nonconvex functions
inferred← citeshttps://doi.org/10.1081/nfa-120006693openalex-snapshot
LIPSCHITZr-INVEX FUNCTIONS AND NONSMOOTH PROGRAMMING
inferred← citeshttps://doi.org/10.1090/s0002-9947-1983-0684505-9openalex-snapshot
A General Sufficiency Theorem for Nonsmooth Nonlinear Programming
inferred← citeshttps://doi.org/10.1090/s0002-9947-1984-0719677-1openalex-snapshot
Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
inferred← citeshttps://doi.org/10.1111/itor.12374openalex-snapshot
Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1981.tb51136.xopenalex-snapshot
NONSMOOTH ANALYSIS AND THE THEORY OF FANS
inferred← citeshttps://doi.org/10.1137/0322017openalex-snapshot
Stability in Mathematical Programming with Nondifferentiable Data
inferred← citeshttps://doi.org/10.1137/0330001openalex-snapshot
Lagrange Multipliers in Stochastic Programming
inferred← citeshttps://doi.org/10.1137/040608544openalex-snapshot
An Implicit Programming Approach for a Class of Stochastic Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1137/050638242openalex-snapshot
A Regularized Sample Average Approximation Method for Stochastic Mathematical Programs with Nonsmooth Equality Constraints
inferred← citeshttps://doi.org/10.1137/130917715openalex-snapshot
KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
inferred← citeshttps://doi.org/10.1137/140971580openalex-snapshot
Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs
inferred← citeshttps://doi.org/10.1137/16m1065215openalex-snapshot
Analysis of the Parallel Schwarz Method for Growing Chains of Fixed-Sized Subdomains: Part I
inferred← citeshttps://doi.org/10.1137/18m1228608openalex-snapshot
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/s0363012994155677openalex-snapshot
Corrigendum: Lagrange Multipliers in Stochastic Programming
inferred← citeshttps://doi.org/10.1137/s0895480199335829openalex-snapshot
Graph Partitioning and Continuous Quadratic Programming
inferred← citeshttps://doi.org/10.1137/s1052623400366656openalex-snapshot
A Fuzzy Necessary Optimality Condition for Non-Lipschitz Optimization in Asplund Spaces
inferred← citeshttps://doi.org/10.1137/s1052623497332329openalex-snapshot
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
inferred← citeshttps://doi.org/10.1137/s1052623499354540openalex-snapshot
A Sharp Lagrange Multiplier Rule for Nonsmooth Mathematical Programming Problems Involving Equality Constraints
inferred← citeshttps://doi.org/10.1287/moor.1070.0260openalex-snapshot
Convergence Analysis of Sample Average Approximation Methods for a Class of Stochastic Mathematical Programs with Equality Constraints
inferred← citeshttps://doi.org/10.1287/moor.1070.0274openalex-snapshot
Variational Analysis in Nonsmooth Optimization and Discrete Optimal Control
inferred← citeshttps://doi.org/10.2206/kyushumfs.37.175openalex-snapshot
FIRST-ORDER OPTIMALITY CONDITIONS IN NONDIFFERENTIABLE PROGRAMMING PROBLEMS
inferred← citeshttps://doi.org/10.23919/acc.2018.8431802openalex-snapshot
Duality Approach to Bilevel Programs with a Convex Lower Level
inferred← citeshttps://doi.org/10.68381/jca12005openalex-snapshot
Relating U-Lagrangians to Second-Order Epi-Derivatives and Proximal Tracks
inferred← citeshttps://doi.org/10.70675/7f14ce19z8a1az4279z91f6zce649f40744copenalex-snapshot
Systèmes dynamiques de descente et algorithmes pour l'optimisation modérée, et les problèmes multi-objectif
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.