The Generic Nature of Optimality Conditions in Nonlinear Programming

Cited in

(23)

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

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)