Computation of the distance to semi-algebraic sets

DOI10.1051/cocv:2000104zbMath1054.14534OpenAlexW1968909669MaRDI QIDQ4941311

Ch. Ferrier

Publication date: 29 February 2000

Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/90563

zbMATH Keywords

semidefinite programmingoptimality conditionspolynomial systemsinterior point methodslocation of zerosdual bond

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Semialgebraic sets and related spaces (14P10) Duality theory (optimization) (49N15)

Related Items (5)

A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information ⋮ An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems ⋮ A proximal bundle method for nonsmooth nonconvex functions with inexact information ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• A new polynomial-time algorithm for linear programming
• Localization of an algebraic hypersurface by the exclusion algorithm
• Dual estimates in multiextremal problems
• Interior-point methods for convex programming
• Hilbert's 17th problem and best dual bounds in quadratic minimization
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• Finding All Solutions to a System of Polynomial Equations
• Semi-Definite Matrix Constraints in Optimization
• Some tests of generalized bisection
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming

This page was built for publication: Computation of the distance to semi-algebraic sets