Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
From MaRDI portal
Publication:496589
DOI10.1007/s10898-015-0269-4zbMath1321.90096OpenAlexW2047601391MaRDI QIDQ496589
E. Alper Yıldırım, 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
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Linear programming (90C05)
Related Items
On standard quadratic programs with exact and inexact doubly nonnegative relaxations ⋮ Improved approximation results on standard quartic polynomial optimization ⋮ A refined error analysis for fixed-degree polynomial optimization over the simplex ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution ⋮ An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Cites Work
- Unnamed Item
- Unnamed Item
- An improved algorithm to test copositivity
- On the computational complexity of membership problems for the completely positive cone and its dual
- Geometry of the copositive and completely positive cones
- On standard quadratic optimization problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- New approximations for the cone of copositive matrices and its dual
- Quadratic programming is in NP
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- Some NP-complete problems in quadratic and nonlinear programming
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
