Well-Posedness in Unconstrained Polynomial Optimization Problems
From MaRDI portal
Publication:5741069
DOI10.1137/15100360XzbMath1344.49043OpenAlexW2460689129MaRDI QIDQ5741069
Tiên Sȯn Phạm, Ha Huy Vui, Van Doat Dang
Publication date: 21 July 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15100360x
Related Items
Stability and genericity for semi-algebraic compact programs, On the solution existence and stability of polynomial optimization problems, Genericity and Hölder stability in semi-algebraic variational inequalities, On the R0-tensors and the solution map of tensor complementarity problems, Optimality Conditions for Minimizers at Infinity in Polynomial Programming, Generic Properties for Semialgebraic Programs, Solution maps of polynomial variational inequalities, On Well-Posedness for Perturbed Quasi-Equilibrium and Quasi-Optimization Problems, Generalized polynomial complementarity problems over a polyhedral cone
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
- The Łojasiewicz exponent of an analytic function at an isolated zero
- Newton polyhedra and toroidal varieties
- Polyedres de Newton et nombres de Milnor
- Semidefinite programming relaxations for semialgebraic problems
- An exact Jacobian SDP relaxation for polynomial optimization
- Global Łojasiewicz-type inequality for non-degenerate polynomial maps
- Distinguished representations of non-negative polynomials
- Hölder-type global error bounds for non-degenerate polynomial systems
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Minimizing polynomials via sum of squares over the gradient ideal
- Generic well-posedness in minimization problems
- Behavior at infinity of a certain class of polynomials
- Typical convex program is very well posed
- Global Optimization with Polynomials and the Problem of Moments
- Global Hölderian Error Bound for Nondegenerate Polynomials
- Polynomial Optimization with Real Varieties
- The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero
- 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
- The BKK root count in $\mathbf {C}^n$
- Semidefinite Programming
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Variational Principles and Well-Posedness in Optimization and Calculus of Variations
- Optimization of Polynomials on Compact Semialgebraic Sets
- Generic Properties for Semialgebraic Programs
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Almost Every Convex or Quadratic Programming Problem Is Well Posed
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
