Stability and genericity for semi-algebraic compact programs
From MaRDI portal
Publication:289119
DOI10.1007/s10957-016-0910-5zbMath1338.90320OpenAlexW2296318261MaRDI QIDQ289119
Publication date: 27 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0910-5
Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Fréchet and Gateaux differentiability in optimization (49J50) Methods involving semicontinuity and convergence; relaxation (49J45)
Related Items
On the solution existence and stability of polynomial optimization problems, SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization, Qualification Conditions in Semialgebraic Programming, Genericity and Hölder stability in semi-algebraic variational inequalities, On continuous selections of polynomial functions, Generic Properties for Semialgebraic Programs, 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
- Optimality conditions and finite convergence of Lasserre's hierarchy
- An explicit bound for the Łojasiewicz exponent of real polynomials
- Well-posed optimization problems
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
- Quadratic programming and affine variational inequalities. A qualitative study.
- Geometric categories and o-minimal structures
- Minimizing polynomials via sum of squares over the gradient ideal
- Global Optimization with Polynomials and the Problem of Moments
- Representations of Positive Polynomials and Optimization on Noncompact Semialgebraic Sets
- Generic Optimality Conditions for Semialgebraic Convex Programs
- Separation of real algebraic sets and the Łojasiewicz exponent
- Global Optimization of Polynomials Using the Truncated Tangency Variety and Sums of Squares
- An Invitation to Tame Optimization
- On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity
- The Generic Nature of Optimality Conditions in Nonlinear Programming
- Stability of Linear-Quadratic Minimization over Euclidean Balls
- Optimization of Polynomials on Compact Semialgebraic Sets
- Generic Properties for Semialgebraic Programs
- Convex Analysis
- Well-Posedness in Unconstrained Polynomial Optimization Problems
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- On the stability of solutions to quadratic programming problems
