Algebraic Degree of Polynomial Optimization

DOI10.1137/080716670zbMath1190.14051arXiv0802.1233OpenAlexW2015508922MaRDI QIDQ5189569

Kristian Ranestad, Jia-Wang Nie

Publication date: 17 March 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.1233

zbMATH Keywords

quadratic programmingvarietyoptimality conditionpolynomial optimizationpth order cone programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Computational aspects of algebraic curves (14Q05) Projective techniques in algebraic geometry (14N05)

Related Items (27)

Gröbner bases and critical values: the asymptotic combinatorics of determinantal systems ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ The saddle point problem of polynomials ⋮ Tensor eigenvalue complementarity problems ⋮ The Maximum Likelihood Degree of Sparse Polynomial Systems ⋮ Algebraic optimization of sequential decision problems ⋮ Semidefinite Relaxation Methods for Tensor Absolute Value Equations ⋮ Optimality conditions and finite convergence of Lasserre's hierarchy ⋮ The geometry of SDP-exactness in quadratic optimization ⋮ Gaussian Likelihood Geometry of Projective Varieties ⋮ Nonlinear algebra and applications ⋮ Linear optimization on varieties and Chern-Mather classes ⋮ Certifying convergence of Lasserre's hierarchy via flat truncation ⋮ Discriminants and nonnegative polynomials ⋮ Solving determinantal systems using homotopy techniques ⋮ Critical points via monodromy and local methods ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ The CP-Matrix Approximation Problem ⋮ On types of degenerate critical points of real polynomial functions ⋮ Algebraic Degree in Semidefinite and Polynomial Optimization ⋮ Multi-objective convex polynomial optimization and semidefinite programming relaxations ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ Saddle points of rational functions ⋮ Bit complexity for computing one point in each connected component of a smooth real algebraic set ⋮ Computing critical points for invariant algebraic systems

This page was built for publication: Algebraic Degree of Polynomial Optimization