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