Generic properties for semialgebraic programs

DOI10.1137/16M1068992MaRDI QIDQ5363376zbMATH OpenOpenAlexFDO

Authors Tien Son Pham, 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-posednessglobal error boundpolynomialgenericityquadratic growthexistence and uniqueness of solutionssemialgebraicgrowth at infinityregular at infinity

Mathematics Subject Classification ID

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

Recommendations

• Generic optimality conditions for semialgebraic convex programs
• Stability and genericity for semi-algebraic compact programs
• Generic minimizing behavior in semialgebraic optimization
• Qualification Conditions in Semialgebraic Programming
• On the generic properties of convex optimization problems in conic form

Cites work

• scientific article; zbMATH DE number 3934056 (Why is no real title available?)
• scientific article; zbMATH DE number 45943 (Why is no real title available?)
• scientific article; zbMATH DE number 192849 (Why is no real title available?)
• scientific article; zbMATH DE number 1201576 (Why is no real title available?)
• scientific article; zbMATH DE number 1984325 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Frank-Wolfe type theorem for nondegenerate polynomial programs
• A Note on Differentiability of Global Optimal Values
• Almost Every Convex or Quadratic Programming Problem Is Well Posed
• An Invitation to Tame Optimization
• An exact Jacobian SDP relaxation for polynomial optimization
• Certifying convergence of Lasserre's hierarchy via flat truncation
• Complementarity and nondegeneracy in semidefinite programming
• Continuity and differentiability of set-valued maps revisited in the light of tame geometry
• First and second order analysis of nonlinear semidefinite programs
• Generic minimizing behavior in semialgebraic optimization
• Generic optimality conditions for semialgebraic convex programs
• Generic properties of the complementarity problem
• Geometric categories and o-minimal structures
• Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
• Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
• Global optimization with polynomials and the problem of moments
• Milnor numbers and the topology of polynomial hypersurfaces
• Minimizing polynomials via sum of squares over the gradient ideal
• Morse Programs: A Topological Approach to Smooth Constrained Optimization
• Morse Theory. (AM-51)
• Nonconvex minimization problems
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• Nonsmooth optimization: conditioning, convergence and semi-algebraic models
• On optimality conditions for structured families of nonlinear programming problems
• On the generic properties of convex optimization problems in conic form
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Optimization of Polynomials on Compact Semialgebraic Sets
• Positive polynomials and sums of squares
• Positivity and sums of squares: a guide to recent results
• Quadratic programming with one negative eigenvalue is NP-hard
• Qualification Conditions in Semialgebraic Programming
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
• Representations of positive polynomials and optimization on noncompact semialgebraic sets
• Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• Semidefinite programming relaxations for semialgebraic problems
• Solving polynomial optimization problems via the truncated tangency variety and sums of squares
• Stability and genericity for semi-algebraic compact programs
• Sums of squares, moment matrices and optimization over polynomials
• The Generic Nature of Optimality Conditions in Nonlinear Programming
• The \(K\)-moment problem for compact semi-algebraic sets
• The global weak sharp minima with explicit exponents in polynomial vector optimization problems
• Truncated \(K\)-moment problems in several variables
• Variational Analysis
• Well-posedness in unconstrained polynomial optimization problems

Cited in

(11)

• Generic optimality conditions for semialgebraic convex programs
• Stability and genericity for semi-algebraic compact programs
• Generalizations of algorithms that find invariant relationships in programs over algebra of terms
• Genericity and Hölder stability in semi-algebraic variational inequalities
• Genericity results in linear conic programming -- a tour d'horizon
• Qualification Conditions in Semialgebraic Programming
• Generic minimizing behavior in semialgebraic optimization
• On continuous selections of polynomial functions
• Well-posedness in unconstrained polynomial optimization problems
• Programs over semigroups of dot-depth one
• Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems

This page was built for publication: Generic properties for semialgebraic programs

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