A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
From MaRDI portal
Publication:2866205
DOI10.1137/130908841zbMath1282.90139arXiv1210.4765MaRDI QIDQ2866205
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4765
global optimizationapproximation algorithmssemidefinite relaxationslinear relaxations0/1 optimizationLagrangian relaxations
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Linear programming (90C05)
Related Items (5)
Duality for mixed-integer convex minimization ⋮ Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity ⋮ A bounded degree SOS hierarchy for polynomial optimization ⋮ A new approximation hierarchy for polynomial conic optimization ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
This page was built for publication: A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
