Approximation Algorithms for Quadratic Programming

Minyue Fu, Zhi-Quan Luo and Yinyu Ye
Additional contact information
Minyue Fu: The University of Newcastle
Zhi-Quan Luo: The University of Newcastle
Yinyu Ye: The University of Newcastle

Journal of Combinatorial Optimization, 1998, vol. 2, issue 1, No 3, 29-50

Abstract: Abstract We consider the problem of approximating the global minimum of a general quadratic program (QP) with n variables subject to m ellipsoidal constraints. For m=1, we rigorously show that an ∈-minimizer, where error ∈ ∈ (0, 1), can be obtained in polynomial time, meaning that the number of arithmetic operations is a polynomial in n, m, and log(1/∈). For m ≥ 2, we present a polynomial-time (1- $$\frac{1}{{m^2 }}$$ )-approximation algorithm as well as a semidefinite programming relaxation for this problem. In addition, we present approximation algorithms for solving QP under the box constraints and the assignment polytope constraints.

Keywords: quadratic programming; global minimizer; polynomial-time approximation algorithm (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009739827008 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:2:y:1998:i:1:d:10.1023_a:1009739827008

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009739827008

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().