Unifying view on sparse convex relaxations in polynomial optimization
From MaRDI portal
Cites work
- A polyhedral branch-and-cut approach to global optimization
- A Positivstellensatz for sums of nonnegative circuit polynomials
- A rigorous global optimization algorithm for problems with ordinary differential equations
- A unified framework of SAGE and SONC polynomials and its duality theory
- An Algorithm for the Traveling Salesman Problem
- An Automatic Method of Solving Discrete Programming Problems
- An introduction to polynomial and semi-algebraic optimization
- Approximation algorithms and semidefinite programming.
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension
- Complete search in continuous global optimization and constraint satisfaction
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convex Bodies The Brunn-MinkowskiTheory
- Convex hulls of monomial curves, and a sparse positivstellensatz
- COSMO: a conic operator splitting method for convex conic problems
- CVXPY: a Python-embedded modeling language for convex optimization
- Deterministic global optimization in nonlinear optimal control problems
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Generalized McCormick relaxations
- Global optimal control with the direct multiple shooting method
- Global optimization of nonconvex problems with multilinear intermediates
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook on semidefinite, conic and polynomial optimization
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- JuMP 1.0: recent improvements to a modeling language for mathematical optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- McCormick-Based Relaxations of Algorithms
- Moment and Polynomial Optimization
- Moments, positive polynomials and their applications
- On representing the positive semidefinite cone using the second-order cone
- Optimal size of linear matrix inequalities in semidefinite approaches to polynomial optimization
- Positive polynomials and sums of squares
- Refined TSSOS
- Relative entropy relaxations for signomial optimization
- Representing polynomials by positive linear functions on compact convex polyhedra
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Optimization and Convex Algebraic Geometry
- Sparse Polynomial Optimization
- Sums of Separable and Quadratic Polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- Symmetries in polynomial optimization
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
This page was built for publication: Unifying view on sparse convex relaxations in polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7315467)
