On the public citation graph
Local structure of feasible sets in nonlinear programming, part I: Regularity
0 signed · 31 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/bfb0120988openalex-snapshot
On regularity conditions in mathematical programming
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.1137/0713043openalex-snapshot
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
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-3-642-99789-1_19openalex-snapshot
Differential Stability Conditions for Saddle Problems on Products of Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/bf00940933openalex-snapshot
On concepts of directional differentiability
inferred← citeshttps://doi.org/10.1007/bf00941297openalex-snapshot
Local stability of solutions to differentiable optimization problems in banach spaces
inferred← citeshttps://doi.org/10.1007/bf01582222openalex-snapshot
Optimality conditions in mathematical programming and composite optimization
inferred← citeshttps://doi.org/10.1007/bf01585928openalex-snapshot
On bilevel programming, Part I: General nonlinear cases
inferred← citeshttps://doi.org/10.1007/bf01585930openalex-snapshot
Implicit function theorems for generalized equations
inferred← citeshttps://doi.org/10.1007/bf01585934openalex-snapshot
Directional derivatives of the solution of a parametric nonlinear program
inferred← citeshttps://doi.org/10.1007/bf02055198openalex-snapshot
On parametric nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02591695openalex-snapshot
Local epi-continuity and local optimization
inferred← citeshttps://doi.org/10.1007/bf02592203openalex-snapshot
Implicit multifunction theorems for the sensitivity analysis of variational conditions
inferred← citeshttps://doi.org/10.1007/bfb0121018openalex-snapshot
Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
inferred← citeshttps://doi.org/10.1007/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferred← citeshttps://doi.org/10.1007/s10107-011-0452-4openalex-snapshot
An augmented Lagrangian approach for sparse principal component analysis
inferred← citeshttps://doi.org/10.1016/j.cam.2006.05.003openalex-snapshot
A generalized Jacobian based Newton method for semismooth block-triangular system of equations
inferred← citeshttps://doi.org/10.1088/0266-5611/28/12/125001openalex-snapshot
A regularized directional derivative-based Newton method for inverse singular value problems
inferred← citeshttps://doi.org/10.1093/imanum/drp031openalex-snapshot
An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
inferred← citeshttps://doi.org/10.1137/060656346openalex-snapshot
A Dual Optimization Approach to Inverse Quadratic Eigenvalue Problems with Partial Eigenstructure
inferred← citeshttps://doi.org/10.1137/0802009openalex-snapshot
Necessary Optimality Conditions for Nonsmooth Multicriterial Optimization Problems
inferred← citeshttps://doi.org/10.1137/s0036142999356719openalex-snapshot
Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
inferred← citeshttps://doi.org/10.1137/s0363012996306121openalex-snapshot
Exact Penalization of Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1287/moor.17.3.586openalex-snapshot
Globally Convergent Newton Methods for Nonsmooth Equations
inferred← citeshttps://doi.org/10.1287/moor.18.1.227openalex-snapshot
Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
inferred← citeshttps://doi.org/10.1287/moor.19.2.352openalex-snapshot
Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
inferred← citeshttps://doi.org/10.1287/moor.23.1.221openalex-snapshot
Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1907.13253openalex-snapshot
Nonsmooth Composite Matrix Optimization: Strong Regularity, Constraint Nondegeneracy and Beyond
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05004openalex-snapshot
Fast projection onto the ordered weighted $\ell_1$ norm ball
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.