Yinyu Ye  Home/Search
Context Related
| uiowa.edu/pub/yyye/bqqp.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: zib.de/helmberg/semidef (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of approximating the global maximum of a quadratic program (QP) subject to bound and (simple) quadratic constraints. Based on several early results, we show that a 4=7-approximate solution can be obtained in polynomial time. Key words. Quadratic programming, global maximizer, approximation algorithm This author is supported in part by NSF grants DMI-9522507 and DMS-9703490. 1 Introduction Consider the quadratic programming (QP) problem with bound and (simple)... (Update)
Cited by: More
Geometry of Semide - Nite Max-Cut Relaxations (Correct)
Error Estimates In The Optimization Of Degree Two Polynomials On .. - Marshall (Correct)
A General Framework for Convex Relaxation of Polynomial.. - Kojima, Kim, Waki (2002) (Correct)
Similar documents (at the sentence level):
24.0%: Approximating Quadratic Programming With Bound Constraints - Ye (1997) (Correct)
Active bibliography (related documents): More All
0.5: Approximating Global Quadratic Optimization With Convex Quadratic.. - Ye (1998) (Correct)
0.2: An Efficient Algorithm for Solving the MAXCUT SDP Relaxation - Burer, Monteiro (1998) (Correct)
0.2: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
Similar documents based on text: More All
0.3: Interior-Point Algorithms: 1997 Annual Progress Report on NSF Grant .. - Ye (1998) (Correct)
0.3: Approximation Algorithms for Quadratic Programming - Fu, Luo, Ye (1998) (Correct)
0.2: Further Development on the Interior Algorithm for Convex Quadratic.. - Ye (1987) (Correct)
Related documents from co-citation: More All
32: Improved approximation algorithms for maximum cut and satisfiability problems us.. - GOEMANS, WILLIAMSON - 1995
20: Semidefinite relaxation and nonconvex quadratic optimization (context) - NESTEROV - 1998
13: Interior-Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovskii - 1994
BibTeX entry: (Update)
Y. YE. Approximating quadratic programming with bound and quadratic constraints. Technical report, Department of Management Sciences The University of Iowa, Iowa city, IA 522542, 1998. To appear in Mathematical Programming. http://citeseer.ist.psu.edu/article/ye98approximating.html More
@article{ ye99approximating,
author = "Y. Ye",
title = "Approximating quadratic programming with bound and quadratic constraints",
journal = "Mathematical Programming",
volume = "84",
pages = "219--226",
year = "1999",
url = "citeseer.ist.psu.edu/article/ye98approximating.html" }
Citations (may not include all citations):415 Improved approximation algorithms for Maximum Cut and Satisf.. - Goemans, Williamson - 1995
307 Interior Point Polynomial Methods in Convex Programming : Th.. (context) - Nesterov, Nemirovskii - 1993
112 Improved approximation algorithms for max k-cut and max bise.. - Frieze, Jerrum - 1995
60 Combinatorial Optimization with Interior Point Methods and S.. (context) - Alizadeh - 1991
57 Constrained Global Optimization: Algorithms and Applications (context) - Pardalos, Rosen - 1987
51 Nonlinear Optimization: Complexity Issues (context) - Vavasis - 1991
40 Approximating quadratic programming with bound constraints - Ye - 1997
36 The complexity of approximating a nonlinear program - Bellare, Rogaway - 1995
27 Quality of semidefinite relaxation for nonconvex quadratic o.. (context) - Nesterov - 1997
26 A continuous based heuristic for the maximum clique problem (context) - Gibbons, Hearn et al. - 1996
25 On affine scaling algorithms for nonconvex quadratic program.. (context) - Ye - 1992
23 Semidefinite programming relaxation for nonconvex quadratic .. (context) - Fujie, Kojima - 1995
21 Cones of matrices and setfunctions (context) - Lov'asz, Shrijver - 1990
6 A recipe for semidefinite relaxation for 0-1 quadratic progr.. (context) - Polijak, Rendl et al. - 1995
1 Ye Approximation algorithms for quadratic programming (context) - Fu, Luo - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zib.de/helmberg/semidef.html): More
The Lovasz Theta Function and a Semidefinite Programming.. - Kleinberg, Goemans (1995) (Correct)
Global and Local Convergence of Predictor-Corrector.. - Kojima, Shida, Shindoh (1995) (Correct)
A Predictor-Corrector Interior-Point Algorithm for the.. - Kojima, Shida, Shindoh (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC