Characterizing stability of parametric nonconvex polynomial optimization problems under total perturbations
From MaRDI portal
Cites work
- A Frank--Wolfe type theorem for convex polynomial programs
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
- An introduction to polynomial and semi-algebraic optimization
- Continuity of the optimal value function in indefinite quadratic programming
- Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
- Convex Analysis
- Convex analysis and global optimization
- Foundations of bilevel programming
- Genericity in polynomial optimization
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 3186512 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Lipschitz continuity of the optimal value function in parametric optimization
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- Mathematical Programs with Equilibrium Constraints
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes
- On polynomial optimization over non-compact semi-algebraic sets
- On the existence of Pareto solutions for polynomial vector optimization problems
- On the optimal value function of a linearly perturbed quadratic program
- On the solution existence and stability of polynomial optimization problems
- On the solution existence to convex polynomial programs and its applications
- On the stability of solutions to quadratic programming problems
- Optimization Problems with Perturbations: A Guided Tour
- Quadratic programming and affine variational inequalities. A qualitative study.
- Solvability of a regular polynomial vector optimization problem without convexity
- Stability and genericity for semi-algebraic compact programs
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Stability of linear-quadratic minimization over Euclidean balls
- Stability of the solution of definite quadratic programs
- Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
This page was built for publication: Characterizing stability of parametric nonconvex polynomial optimization problems under total perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7254699)