Separable standard quadratic optimization problems

DOI10.1007/s11590-011-0309-zzbMath1254.90145OpenAlexW1967929712MaRDI QIDQ1758025

Immanuel M. Bomze, Marco Locatelli

Publication date: 7 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0309-z

zbMATH Keywords

polynomial-time algorithmstandard quadratic optimizationmulti-standard quadratic optimization

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20)

Related Items (3)

Sparse solutions to random standard quadratic optimization problems ⋮ Balancing of agricultural census data by using discrete optimization ⋮ Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems

Cites Work

• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
• Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
• Maxima for Graphs and a New Proof of a Theorem of Turán

This page was built for publication: Separable standard quadratic optimization problems