Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
From MaRDI portal
Publication:496589
DOI10.1007/S10898-015-0269-4zbMATH Open1321.90096OpenAlexW2047601391MaRDI QIDQ496589FDOQ496589
E. Alper Yildirim, Gizem Sağol
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://cdm21054.contentdm.oclc.org/cdm/ref/collection/IR/id/6066
Recommendations
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A linear programming reformulation of the standard quadratic optimization problem
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Inner approximations of completely positive reformulations of mixed binary quadratic programs: a unified analysis
Quadratic programming (90C20) Linear programming (90C05) Nonconvex programming, global optimization (90C26)
Cites Work
- Some NP-complete problems in quadratic and nonlinear programming
- Global optimization with polynomials and the problem of moments
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the stability number of a graph via copositive programming
- Interior points of the completely positive cone
- An adaptive linear approximation algorithm for copositive programs
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- Title not available (Why is that?)
- 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
- On the computational complexity of membership problems for the completely positive cone and its dual
- Geometry of the copositive and completely positive cones
- New approximations for the cone of copositive matrices and its dual
- On the accuracy of uniform polyhedral approximations of the copositive cone
- On copositive programming and standard quadratic optimization problems
- On standard quadratic optimization problems
- Quadratic programming is in NP
- An improved algorithm to test copositivity
Cited In (13)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations
- A linear programming reformulation of the standard quadratic optimization problem
- A new branch-and-bound algorithm for standard quadratic programming problems
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On copositive programming and standard quadratic optimization problems
- Title not available (Why is that?)
- A refined error analysis for fixed-degree polynomial optimization over the simplex
- Improved approximation results on standard quartic polynomial optimization
- Copositivity aspects of standard quadratic optimization problems
- Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution
This page was built for publication: Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496589)
