Qualification Conditions in Semialgebraic Programming

DOI10.1137/16M1133889zbMath1396.49007arXiv1705.08219MaRDI QIDQ4571881

Jérôme Bolte, Antoine Hochart, Edouard Pauwels

Publication date: 3 July 2018

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.08219

zbMATH Keywords

Lagrange multipliersoptimality conditionsconstraint qualificationArrow-Hurwicz-UzawaMangasarian-Fromovitz constraint quailificationtame programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Variational inequalities (49J40) Nonsmooth analysis (49J52) Time-scale analysis and singular perturbations in control/observation systems (93C70) Real-analytic and semi-analytic sets (14P15) Gradient-like behavior; isolated (locally maximal) invariant sets; attractors, repellers for topological dynamical systems (37B35) Optimality conditions for problems involving relations other than differential equations (49K21)

Related Items

Genericity and Hölder stability in semi-algebraic variational inequalities, On continuous selections of polynomial functions, Generic Properties for Semialgebraic Programs, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, Existence of Pareto solutions for vector polynomial optimization problems with constraints

Uses Software

• PLCP
• SQPlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability and genericity for semi-algebraic compact programs
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Some inverse mapping theorems
• Convex analysis and nonlinear optimization. Theory and examples.
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Tame functions are semismooth
• The \(K\)-moment problem for compact semi-algebraic sets
• Bounding the number of connected components of a real algebraic set
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• The upper bound theorem for polytopes: An easy proof of its asymptotic version
• Geometric categories and o-minimal structures
• An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming
• Hölder metric regularity of set-valued maps
• Minimizing polynomials via sum of squares over the gradient ideal
• A Sard theorem for tame set-valued mappings
• Global Optimization with Polynomials and the Problem of Moments
• Generic Minimizing Behavior in Semialgebraic Optimization
• Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
• Sequential Quadratic Programming Methods
• Genericity in Polynomial Optimization
• Continuity and differentiability of set-valued maps revisited in the light of tame geometry
• Generic Optimality Conditions for Semialgebraic Convex Programs
• Clarke Subgradients of Stratifiable Functions
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• Morse Programs: A Topological Approach to Smooth Constrained Optimization
• Variational Analysis
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Ideals, Varieties, and Algorithms
• Generic Properties for Semialgebraic Programs
• Implicit Functions and Solution Mappings
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• The maximum numbers of faces of a convex polytope
• How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
• Numerical optimization. Theoretical and practical aspects. Transl. from the French