Stability and genericity for semi-algebraic compact programs
DOI10.1007/S10957-016-0910-5zbMATH Open1338.90320OpenAlexW2296318261MaRDI QIDQ289119FDOQ289119
Authors: Tien Son Pham, Gue Myung Lee 
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
Recommendations
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Methods involving semicontinuity and convergence; relaxation (49J45) Sensitivity, stability, well-posedness (49K40) Fréchet and Gateaux differentiability in optimization (49J50)
Cites Work
- Convex Analysis
- Geometric categories and o-minimal structures
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing polynomials via sum of squares over the gradient ideal
- Sums of squares, moment matrices and optimization over polynomials
- Optimization of Polynomials on Compact Semialgebraic Sets
- 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 and optimization on noncompact semialgebraic sets
- Title not available (Why is that?)
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- 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.
- 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
- Title not available (Why is that?)
- Optimality conditions and finite convergence of Lasserre's hierarchy
- An explicit bound for the Łojasiewicz exponent of real polynomials
- Stability of linear-quadratic minimization over Euclidean balls
- Generic properties for semialgebraic programs
- Positive polynomials and sums of squares
- Well-posedness in unconstrained polynomial optimization problems
- On the stability of solutions to quadratic programming problems
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
Cited In (12)
- Stability of termination and sufficient-completeness under pushouts via amalgamation
- Qualification Conditions in Semialgebraic Programming
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Title not available (Why is that?)
- Genericity in polynomial optimization
- On the solution existence and stability of polynomial optimization problems
- 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
- Generic properties for semialgebraic programs
- Genericity and Hölder stability in semi-algebraic variational inequalities
This page was built for publication: Stability and genericity for semi-algebraic compact programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289119)
