Generic properties for semialgebraic programs
DOI10.1137/16M1068992zbMATH Open1396.90065OpenAlexW2760008085MaRDI QIDQ5363376FDOQ5363376
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
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
coercivityoptimality conditionswell-posednessglobal error boundpolynomialgenericityquadratic growthexistence and uniqueness of solutionssemialgebraicgrowth at infinityregular at infinity
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Sensitivity, stability, well-posedness (49K40) Semialgebraic sets and related spaces (14P10)
Cites Work
- Variational Analysis
- Title not available (Why is that?)
- Geometric categories and o-minimal structures
- Global optimization with polynomials and the problem of moments
- Morse Theory. (AM-51)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(K\)-moment problem for compact semi-algebraic sets
- Semidefinite programming relaxations for semialgebraic problems
- Minimizing polynomials via sum of squares over the gradient ideal
- Sums of squares, moment matrices and optimization over polynomials
- Positivity and sums of squares: a guide to recent results
- Title not available (Why is that?)
- Nonconvex minimization problems
- Optimization of Polynomials on Compact Semialgebraic Sets
- Almost Every Convex or Quadratic Programming Problem Is Well Posed
- Representations of positive polynomials and optimization on noncompact semialgebraic sets
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Quadratic programming with one negative eigenvalue is NP-hard
- Complementarity and nondegeneracy in semidefinite programming
- An exact Jacobian SDP relaxation for polynomial optimization
- Stability and genericity for semi-algebraic compact programs
- Generic optimality conditions for semialgebraic convex programs
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- An Invitation to Tame Optimization
- The Generic Nature of Optimality Conditions in Nonlinear Programming
- Title not available (Why is that?)
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Title not available (Why is that?)
- Positive polynomials and sums of squares
- Well-posedness in unconstrained polynomial optimization problems
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Title not available (Why is that?)
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- First and second order analysis of nonlinear semidefinite programs
- Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
- Truncated \(K\)-moment problems in several variables
- Continuity and differentiability of set-valued maps revisited in the light of tame geometry
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Milnor numbers and the topology of polynomial hypersurfaces
- Generic minimizing behavior in semialgebraic optimization
- On the generic properties of convex optimization problems in conic form
- A Note on Differentiability of Global Optimal Values
- Morse Programs: A Topological Approach to Smooth Constrained Optimization
- Generic properties of the complementarity problem
- Nonsmooth optimization: conditioning, convergence and semi-algebraic models
- Qualification Conditions in Semialgebraic Programming
- The global weak sharp minima with explicit exponents in polynomial vector optimization problems
- On optimality conditions for structured families of nonlinear programming problems
Cited In (11)
- Qualification Conditions in Semialgebraic Programming
- Stability and genericity for semi-algebraic compact programs
- Generic minimizing behavior in semialgebraic optimization
- On continuous selections of polynomial functions
- Generic optimality conditions for semialgebraic convex programs
- Well-posedness in unconstrained polynomial optimization problems
- Programs over semigroups of dot-depth one
- Genericity results in linear conic programming -- a tour d'horizon
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems
- Generalizations of algorithms that find invariant relationships in programs over algebra of terms
- Genericity and Hölder stability in semi-algebraic variational inequalities
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)