Stability and genericity for semi-algebraic compact programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5788282 (Why is no real title available?)
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- An Invitation to Tame Optimization
- An explicit bound for the Łojasiewicz exponent of real polynomials
- Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
- Convex Analysis
- Generic optimality conditions for semialgebraic convex programs
- Generic properties for semialgebraic programs
- 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
- Minimizing polynomials via sum of squares over the gradient ideal
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- On the Lipschitz behavior of optimal solutions in parametric problems of quadratic optimization and linear complementarity
- On the stability of solutions to quadratic programming problems
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization of Polynomials on Compact Semialgebraic Sets
- Positive polynomials and sums of squares
- Quadratic programming and affine variational inequalities. A qualitative study.
- Representations of positive polynomials and optimization on noncompact semialgebraic sets
- Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals
- Separation of real algebraic sets and the Łojasiewicz exponent
- Solving polynomial optimization problems via the truncated tangency variety and sums of squares
- Stability of linear-quadratic minimization over Euclidean balls
- Sums of squares, moment matrices and optimization over polynomials
- The Generic Nature of Optimality Conditions in Nonlinear Programming
- Well-posed optimization problems
- Well-posedness in unconstrained polynomial optimization problems
Cited in
(12)- Genericity in polynomial optimization
- Generic optimality conditions for semialgebraic convex programs
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Genericity and Hölder stability in semi-algebraic variational inequalities
- On the solution existence and stability of polynomial optimization problems
- Qualification Conditions in Semialgebraic Programming
- Generic minimizing behavior in semialgebraic optimization
- On continuous selections of polynomial functions
- Well-posedness in unconstrained polynomial optimization problems
- Stability of termination and sufficient-completeness under pushouts via amalgamation
- Generic properties for semialgebraic programs
- scientific article; zbMATH DE number 4076979 (Why is no real title available?)
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)
