The Generic Nature of Optimality Conditions in Nonlinear Programming

DOI10.1287/MOOR.4.4.425MaRDI QIDQ3858047zbMATH OpenOpenAlexFDO

Authors Jonathan E. Spingarn, R. T. Rockafellar

Publication date 1979

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3595dc915e82bf687cc5da814cbdfc154ab86edb

zbMATH Keywords

nonlinear programmingoptimality conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited in

(25)

• A new constraint qualification condition
• Equivalence of saddle-points and optima for non-concave programmes
• Conditions for generic normality in optimal control
• A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
• Sensitivity analysis in geometric programming
• Duality of regularizations and hullfunctions for mathematical programming problems
• Genericity and Hölder stability in semi-algebraic variational inequalities
• On the Burer-Monteiro method for general semidefinite programs
• Typical convex program is very well posed
• Generic minimizing behavior in semialgebraic optimization
• Strongly convex functions, Moreau envelopes, and the generic nature of convex functions with strong minimizers
• Stability and genericity for semi-algebraic compact programs
• An exact penalty function method with global convergence properties for nonlinear programming problems
• Equilibrium programming:The path following approach and dynamics
• On optimality conditions for structured families of nonlinear programming problems
• Submonotone mappings and the proximal point algorithm
• Qualification Conditions in Semialgebraic Programming
• Versions of the Sard theorem for essentially smooth Lipschitz maps and applications in optimization and nonsmooth equations
• Generic properties for semialgebraic programs
• Error bounds and singularity degree in semidefinite programming
• Tangencies and polynomial optimization
• On continuous selections of polynomial functions
• Simple Inference on Functionals of Set-Identified Parameters Defined by Linear Moments
• How stringent is the linear independence kink qualification in abs-smooth optimization?
• Discretization algorithms for generalized semi-infinite programs with coupling equality constraints under local solution stability

This page was built for publication: The Generic Nature of Optimality Conditions in Nonlinear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858047)