A multilevel analysis of the Lasserre hierarchy
From MaRDI portal
Publication:1735163
DOI10.1016/j.ejor.2019.02.016zbMath1430.90456OpenAlexW2913427762MaRDI QIDQ1735163
Ruth Misener, Juan S. Campos, Panos Parpas
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.016
global optimizationsemidefinite programmingpolynomial optimizationconic programming and interior point methods
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Partial Lasserre relaxation for sparse Max-Cut, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
Uses Software
Cites Work
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Optimality conditions and finite convergence of Lasserre's hierarchy
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A MAX-CUT formulation of 0/1 programs
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- A bounded degree SOS hierarchy for polynomial optimization
- Constrained 0-1 quadratic programming: basic approaches and extensions
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- Global Optimization with Polynomials and the Problem of Moments
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Multigrid Approach to SDP Relaxations of Sparse Polynomial Optimization Problems
- Optimization of Polynomials on Compact Semialgebraic Sets
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
