Generic Properties for Semialgebraic Programs

DOI10.1137/16M1068992zbMath1396.90065OpenAlexW2760008085MaRDI QIDQ5363376

Tiên Sȯn Phạm, Gue Myung Lee

Publication date: 6 October 2017

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

Full work available at URL: https://doi.org/10.1137/16m1068992

zbMATH Keywords

coercivityoptimality conditionswell-posednesspolynomialgenericityexistence and uniqueness of solutionsglobal error boundquadratic growthsemialgebraicgrowth at infinityregular at infinity

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Semialgebraic sets and related spaces (14P10)

Related Items (6)

Stability and genericity for semi-algebraic compact programs ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Genericity and Hölder stability in semi-algebraic variational inequalities ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ On continuous selections of polynomial functions ⋮ Well-Posedness in Unconstrained Polynomial Optimization Problems

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A Frank-Wolfe type theorem for nondegenerate polynomial programs
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• Milnor numbers and the topology of polynomial hypersurfaces
• The \(K\)-moment problem for compact semi-algebraic sets
• Quadratic programming with one negative eigenvalue is NP-hard
• Complementarity and nondegeneracy in semidefinite programming
• First and second order analysis of nonlinear semidefinite programs
• Semidefinite programming relaxations for semialgebraic problems
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• The global weak sharp minima with explicit exponents in polynomial vector optimization problems
• Geometric categories and o-minimal structures
• An exact Jacobian SDP relaxation for polynomial optimization
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Minimizing polynomials via sum of squares over the gradient ideal
• Global Optimization with Polynomials and the Problem of Moments
• Generic Minimizing Behavior in Semialgebraic Optimization
• Continuity and differentiability of set-valued maps revisited in the light of tame geometry
• Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
• Generic Optimality Conditions for Semialgebraic Convex Programs
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
• An Invitation to Tame Optimization
• A Note on Differentiability of Global Optimal Values
• Morse Theory. (AM-51)
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• Nonconvex minimization problems
• On optimality conditions for structured families of nonlinear programming problems
• Morse Programs: A Topological Approach to Smooth Constrained Optimization
• Variational Analysis
• Qualification Conditions in Semialgebraic Programming
• Generic properties of the complementarity problem
• Optimization of Polynomials on Compact Semialgebraic Sets
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• Almost Every Convex or Quadratic Programming Problem Is Well Posed
• Well-Posedness in Unconstrained Polynomial Optimization Problems
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• On the generic properties of convex optimization problems in conic form

This page was built for publication: Generic Properties for Semialgebraic Programs