On the public citation graph
Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
0 signed · 62 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/bf00934319openalex-snapshot
Minimal representation of convex polyhedral sets
inferredcites →https://doi.org/10.1007/bfb0112538openalex-snapshot
Local structure of feasible sets in nonlinear programming, part I: Regularity
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1137/0317052openalex-snapshot
Nonlinear Perturbation of Linear Programs
inferredcites →https://doi.org/10.1287/moor.5.1.43openalex-snapshot
Strongly Regular Generalized Equations
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-4939-1037-3_4openalex-snapshot
Metric Regularity Through Generalized Derivatives
inferred← citeshttps://doi.org/10.1007/978-3-642-36062-6_16openalex-snapshot
Robustness Analysis of Stochastic Programs with Joint Probabilistic Constraints
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/bfb0121154openalex-snapshot
Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
inferred← citeshttps://doi.org/10.1007/s00186-013-0429-6openalex-snapshot
Aubin property and uniqueness of solutions in cone constrained optimization
inferred← citeshttps://doi.org/10.1007/s00211-011-0415-yopenalex-snapshot
Nonnegative inverse eigenvalue problems with partial eigendata
inferred← citeshttps://doi.org/10.1007/s10107-003-0443-1openalex-snapshot
Variational conditions with smooth constraints: structure and analysis
inferred← citeshttps://doi.org/10.1007/s10107-007-0105-9openalex-snapshot
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10107-009-0288-3openalex-snapshot
Implications of the constant rank constraint qualification
inferred← citeshttps://doi.org/10.1007/s10107-011-0509-4openalex-snapshot
Equations on monotone graphs
inferred← citeshttps://doi.org/10.1007/s10107-014-0853-2openalex-snapshot
A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
inferred← citeshttps://doi.org/10.1007/s10107-015-0961-7openalex-snapshot
A rank-corrected procedure for matrix completion with fixed basis coefficients
inferred← citeshttps://doi.org/10.1007/s10107-016-1037-zopenalex-snapshot
A Short Proof of the Sticky Face Lemma
inferred← citeshttps://doi.org/10.1007/s10107-018-1250-zopenalex-snapshot
Statistical inference of semidefinite programming
inferred← citeshttps://doi.org/10.1007/s101070050090openalex-snapshot
Ergodic, primal convergence in dual subgradient schemes for convex programming
inferred← citeshttps://doi.org/10.1007/s10898-018-0676-4openalex-snapshot
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-025-01492-7openalex-snapshot
A dual adaptive algorithm for matrix optimization with sparse group lasso regularization
inferred← citeshttps://doi.org/10.1007/s10915-025-02877-2openalex-snapshot
A Nonmonotone Active-Set Semismooth Newton Method for Matrix Approximation with Group Regularization
inferred← citeshttps://doi.org/10.1007/s10957-010-9758-2openalex-snapshot
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
inferred← citeshttps://doi.org/10.1007/s10957-016-0871-8openalex-snapshot
Differentiability Properties of Metric Projections onto Convex Sets
inferred← citeshttps://doi.org/10.1007/s10957-016-0897-yopenalex-snapshot
Second-Order Analysis of Piecewise Linear Functions with Applications to Optimization and Stability
inferred← citeshttps://doi.org/10.1007/s10957-024-02378-6openalex-snapshot
Role of Subgradients in Variational Analysis of Polyhedral Functions
inferred← citeshttps://doi.org/10.1007/s11117-011-0126-8openalex-snapshot
Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
inferred← citeshttps://doi.org/10.1007/s11228-016-0378-3openalex-snapshot
Variational Analysis of the Ky Fan k-norm
inferred← citeshttps://doi.org/10.1007/s11228-019-00519-yopenalex-snapshot
New Sharp Necessary Optimality Conditions for Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1007/s11425-020-1743-9openalex-snapshot
Fast projection onto the ordered weighted ℓ1 norm ball
inferred← citeshttps://doi.org/10.1007/s11425-021-1920-5openalex-snapshot
Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
inferred← citeshttps://doi.org/10.1016/j.cam.2014.02.027openalex-snapshot
An augmented Lagrangian dual optimization approach to the H -weighted model updating problem
inferred← citeshttps://doi.org/10.1016/j.laa.2008.10.010openalex-snapshot
Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
inferred← citeshttps://doi.org/10.1016/s0294-1449(16)30335-3openalex-snapshot
Convergence of convex-concave saddle functions: applications to convex programming and mechanics
inferred← citeshttps://doi.org/10.1023/b:jogo.0000026458.55147.46openalex-snapshot
A Linearization Method for Nondegenerate Variational Conditions
inferred← citeshttps://doi.org/10.1080/02331934.2019.1576668openalex-snapshot
On the characterizations of solutions to perturbed l1 conic optimization problem
inferred← citeshttps://doi.org/10.1080/10556789808805688openalex-snapshot
Ergodic convergence in subgradient optimization
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/0331063openalex-snapshot
Weak Sharp Minima in Mathematical Programming
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/060675320openalex-snapshot
Exact Regularization of Convex Programs
inferred← citeshttps://doi.org/10.1137/070681235openalex-snapshot
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/0802009openalex-snapshot
Necessary Optimality Conditions for Nonsmooth Multicriterial Optimization Problems
inferred← citeshttps://doi.org/10.1137/080727075openalex-snapshot
Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
inferred← citeshttps://doi.org/10.1137/130928637openalex-snapshot
Full Stability of Locally Optimal Solutions in Second-Order Cone Programs
inferred← citeshttps://doi.org/10.1137/16m1066816openalex-snapshot
Computation of Graphical Derivative for a Class of Normal Cone Mappings under a Very Weak Condition
inferred← citeshttps://doi.org/10.1137/s1052623495284029openalex-snapshot
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
inferred← citeshttps://doi.org/10.1137/s1052623497316518openalex-snapshot
Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
inferred← citeshttps://doi.org/10.1287/moor.1060.0195openalex-snapshot
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
inferred← citeshttps://doi.org/10.1287/moor.1080.0315openalex-snapshot
Local Duality of Nonlinear Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.1090.0431openalex-snapshot
Variational Conditions Under the Constant Rank Constraint Qualification
inferred← citeshttps://doi.org/10.1287/moor.16.2.292openalex-snapshot
An Implicit-Function Theorem for a Class of Nonsmooth Functions
inferred← citeshttps://doi.org/10.1287/moor.2021.1205openalex-snapshot
On Degenerate Doubly Nonnegative Projection Problems
inferred← citeshttps://doi.org/10.1287/moor.2023.0311openalex-snapshot
A Squared Smoothing Newton Method for Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.2024.0692openalex-snapshot
Lipschitz Stability of Least-Squares Problems Regularized by Functions with C2-Cone Reducible Conjugates
inferred← citeshttps://doi.org/10.1287/moor.23.1.221openalex-snapshot
Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions
inferred← citeshttps://doi.org/10.1287/moor.28.2.201.14480openalex-snapshot
Constraint Nondegeneracy in Variational Analysis
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.