Optimization over polynomials: selected topics
From MaRDI portal
Publication:4589032
Recommendations
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
- Saddle points of rational functions
- Homogenization for polynomial optimization with unbounded sets
- 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
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- 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
- Continuous optimization problems and a polynomial hierarchy of real functions
- Polynomial optimization, sums of squares, and applications
- Bilevel polynomial programs and semidefinite relaxation methods
- An introduction to polynomial and semi-algebraic optimization
- Quadratic tensor eigenvalue complementarity problems
- Convex generalized Nash equilibrium problems and polynomial optimization
- Logical Approaches to Computational Barriers
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Loss functions for finite sets
- Preface to the special issue on optimization with polynomials and tensors
- A matrix Positivstellensatz with lifting polynomials
- 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)
