A linear programming reformulation of the standard quadratic optimization problem
DOI10.1007/S10898-006-9037-9zbMATH Open1127.90051OpenAlexW2163155064WikidataQ56874369 ScholiaQ56874369MaRDI QIDQ868634FDOQ868634
Authors: E. de Klerk, Dmitrii V. Pasechnik 
Publication date: 6 March 2007
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9037-9
Recommendations
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Unconstrained formulation of standard quadratic optimization problems
- On standard quadratic optimization problems
- Quartic formulation of standard quadratic optimization problems
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Approximation of the stability number of a graph via copositive programming
- LMI Approximations for Cones of Positive Semidefinite Forms
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- Semidefinite representations for finite varieties
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- Linear inequalities and quadratic forms
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Polynomial Programming: LP-Relaxations Also Converge
Cited In (16)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Complete positivity and distance-avoiding sets
- Quartic formulation of standard quadratic optimization problems
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Title not available (Why is that?)
- Copositive optimization -- recent developments and applications
- A new branch-and-bound algorithm for standard quadratic programming problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Title not available (Why is that?)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- On the computation of \(C^*\) certificates
- New approximations for the cone of copositive matrices and its dual
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
This page was built for publication: A linear programming reformulation of the standard quadratic optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868634)
