A linear programming reformulation of the standard quadratic optimization problem
From MaRDI portal
Publication:868634
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
Cites work
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Approximation of the stability number of a graph via copositive programming
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- LMI Approximations for Cones of Positive Semidefinite Forms
- Linear inequalities and quadratic forms
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Polynomial Programming: LP-Relaxations Also Converge
- Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Semidefinite representations for finite varieties
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
Cited in
(20)- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- A complete semidefinite algorithm for detecting copositive matrices and tensors
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Complete positivity and distance-avoiding sets
- Quartic formulation of standard quadratic optimization problems
- Unconstrained formulation of standard quadratic optimization problems
- Standard bi-quadratic optimization problems and unconstrained polynomial reformulations
- Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- scientific article; zbMATH DE number 977754 (Why is no real title available?)
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
- A new branch-and-bound algorithm for standard quadratic programming problems
- scientific article; zbMATH DE number 7152114 (Why is no real title available?)
- Copositive optimization -- recent developments and applications
- On the computation of \(C^*\) certificates
- New approximations for the cone of copositive matrices and its dual
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma
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)
