Optimization over polynomials: selected topics

zbMATH Open1373.90097MaRDI QIDQ4589032FDOQ4589032

Authors: Monique Laurent 

Publication date: 6 November 2017

Recommendations

• scientific article; zbMATH DE number 1984325
• An introduction to polynomial and semi-algebraic optimization
• Semidefinite programming in combinatorial and polynomial optimization
• Moments and sums of squares for polynomial optimization and related problems
• The method of moments in global optimization

zbMATH Keywords

combinatorial optimizationpolynomial optimizationsemidefinite optimizationmoment problempositive polynomialsum of squares

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonlinear programming (90C30) Semidefinite programming (90C22) Basic linear algebra (15A99) Semialgebraic sets and related spaces (14P10) Moment problems (44A60) Real algebra (13J30)

Cited In (34)

• The saddle point problem of polynomials
• Computation with polynomial equations and inequalities arising in combinatorial optimization
• Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications
• The maximum tensor complementarity eigenvalues
• Higher-degree tensor eigenvalue complementarity problems
• Amalgamation of real zero polynomials
• From combinatorial optimization to real algebraic geometry and back
• Optimization via Chebyshev polynomials
• An SDP method for copositivity of partially symmetric tensors
• Homogenization for polynomial optimization with unbounded sets
• Saddle points of rational functions
• A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems
• Exploiting algebraic structure in global optimization and the Belgian chocolate problem
• Noncommutative polynomials describing convex sets
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
• Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach
• On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
• Minimizing polynomials via sum of squares over the gradient ideal
• A Lagrange multiplier expression method for bilevel polynomial optimization
• Solving polynomial least squares problems via semidefinite programming relaxations
• A semidefinite relaxation method for second-order cone polynomial complementarity problems
• Bilevel polynomial programs and semidefinite relaxation methods
• Polynomial optimization, sums of squares, and applications
• Continuous optimization problems and a polynomial hierarchy of real functions
• An introduction to polynomial and semi-algebraic optimization
• Logical Approaches to Computational Barriers
• Quadratic tensor eigenvalue complementarity problems
• Convex generalized Nash equilibrium problems and polynomial optimization
• A matrix Positivstellensatz with lifting polynomials
• Loss functions for finite sets
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions
• Preface to the special issue on optimization with polynomials and tensors
• Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces

This page was built for publication: Optimization over polynomials: selected topics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589032)