The Generic Nature of Optimality Conditions in Nonlinear Programming
From MaRDI portal
Publication:3858047
DOI10.1287/moor.4.4.425zbMath0423.90071OpenAlexW2052731183MaRDI QIDQ3858047
Jonathan E. Spingarn, R. Tyrrell 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
Related Items (22)
Stability and genericity for semi-algebraic compact programs ⋮ Duality of regularizations and hullfunctions for mathematical programming problems ⋮ Conditions for generic normality in optimal control ⋮ A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Genericity and Hölder stability in semi-algebraic variational inequalities ⋮ Tangencies and polynomial optimization ⋮ An exact penalty function method with global convergence properties for nonlinear programming problems ⋮ On continuous selections of polynomial functions ⋮ Sensitivity analysis in geometric programming ⋮ Generic Properties for Semialgebraic Programs ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ On the Burer-Monteiro method for general semidefinite programs ⋮ Strongly Convex Functions, Moreau Envelopes, and the Generic Nature of Convex Functions with Strong Minimizers ⋮ Unnamed Item ⋮ Equilibrium programming:The path following approach and dynamics ⋮ On optimality conditions for structured families of nonlinear programming problems ⋮ Error Bounds and Singularity Degree in Semidefinite Programming ⋮ Typical convex program is very well posed ⋮ A new constraint qualification condition ⋮ Equivalence of saddle-points and optima for non-concave programmes ⋮ Submonotone mappings and the proximal point algorithm
This page was built for publication: The Generic Nature of Optimality Conditions in Nonlinear Programming
