(Enter summary)
Abstract: We consider three parametric relaxations of the 0-1 quadratic programming
problem. These relaxations are to: quadratic maximization
over simple box constraints, quadratic maximization over the sphere,
and the maximum eigenvalue of a bordered matrix. When minimized
over the parameter, each of the relaxations provides an upper bound
on the original discrete problem. Moreover, these bounds are efficiently
computable. Our main result is that, surprisingly, all three bounds are
equal.
This author ... (Update)
Context of citations to this paper: More
...C # : In general, it may be more advantageous to choose a particular dense row and column for the vector b. Therefore, from Theorem 4. 1 in [13], an equivalent max min problem is the parametric trust region subproblem (TRP ) n 1) max u t e=0 min x t x=n x t (C Gamma...
.... in practice, see e.g. 12, 18, 15] Other theoretical results for general objectives and further relaxed constraints appear in [31, 46] In [38], several unrelated bounds for MC are shown to be equivalent. These bounds include the box relaxation Gammae x e, the trust region...
Cited by: More
A Recipe for Semidefinite Relaxation for (0,1)-Quadratic.. - Poljak, Rendl, Wolkowicz (1992)
(Correct)
Semidefinite Programming - Wolkowicz (1999)
(Correct)
On Lagrangian Relaxation of Quadratic Matrix Constraints - Anstreicher, Wolkowicz (1998)
(Correct)
Active bibliography (related documents): More All
0.9: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)
(Correct)
0.8: Indefinite Trust Region Subproblems And Nonsymmetric.. - Stern, Wolkowicz (1995)
(Correct)
0.5: Connections Between Semidefinite Relaxations of the.. - Laurent, Poljak, Rendl (1995)
(Correct)
Similar documents based on text: More All
0.4: Combining Semidefinite and Polyhedral Relaxations.. - Helmberg, Poljak.. (1995)
(Correct)
0.4: Node and Edge Relaxations of the Max-Cut Problem - Poljak, Rendl (1994)
(Correct)
0.3: Foreword: for Special Issue on Semidefinite Programming - Overton, Wolkowicz
(Correct)
Related documents from co-citation: More All
4: An interior-- point method for semidefinite programming
- Helmberg, Rendl et al. - 1996
3: Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations
- STERN, WOLKOWICZ - 1995
3: Cones of matrices and set-functions and 0-1 optimization (context) - Lov'asz, Schrijver - 1991
BibTeX entry: (Update)
S. POLJAK and H. WOLKOWICZ. Convex relaxations of 0-1 quadratic programming. Technical Report 93-18, DIMACS, 1993. http://citeseer.ist.psu.edu/poljak93convex.html More
@techreport{ poljak93convex,
author = "Svatopluk Poljak and Henry Wolkowicz",
title = "Convex Relaxations of 0-1 Quadratic Programming",
number = "93-18",
year = "1993",
url = "citeseer.ist.psu.edu/poljak93convex.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A guide to the theory of NP--c.. (context) - GAREY, JOHNSON - 1979
708
Cambridge University Press (context) - HORN, JOHNSON - 1985
640
Princeton University Press (context) - ROCKAFELLAR - 1970
307
Interior Point Polynomial Methods in Convex Programming : Th.. (context) - NESTEROV, NEMIROVSKY - 1993
250
Optimization by Vector Space Methods (context) - LUENBERGER - 1969
125
LANCELOT: a Fortran package for large-scale nonlinear optimi.. (context) - CONN, GOULD et al. - 1992
98
Computing a trust region step (context) - MOR, SORENSEN - 1983
93
IEEE Transactions on Information Theory (context) - LOVASZ, Shannon et al. - 1979
88
Eigenvalues and graph bisection: An average case analysis (context) - BOPPANA - 1987
82
Lower bounds for the partitioning of graphs (context) - DONATH, HOFFMAN - 1973
76
A version of the bundle idea for minimizing a nonsmooth func.. (context) - SCHRAMM, ZOWE - 1992
49
Large-scale optimization of eigenvalues
- OVERTON - 1992
46
Laplacian eigenvalues and the maximum cut problem (context) - DELORME, POLJAK - 1990
43
Computing optimal locally constrained steps (context) - GAY - 1981
42
Introduction to Sensitivity and Stability Analysis in Nonlin.. (context) - FIACCO - 1983
41
A projection technique for partitioning the nodes of a graph
- RENDL, WOLKOWICZ - 1990
35
Applications of parametric programming and eigenvalue maximi.. (context) - RENDL, WOLKOWICZ - 1992
30
Indefinite trust region subproblems and nonsymmetric eigenva..
- STERN, WOLKOWICZ - 1992
25
On affine scaling algorithms for nonconvex quadratic program.. (context) - YE - 1992
20
the sum of the largest eigenvalues of a symmetric matrix (context) - OVERTON, WOMERSLEY - 1992
16
Polynomial solvability of convex quadratic programming (context) - KOZLOV, TARASOV et al. - 1979
15
Large-scale numerical optimization: Introduction and overvie.. (context) - COLEMAN - 1991
10
Introduction to Minimax (context) - DEM'JANOV, MALOZEMOV - 1974
9
A continuous method for computing bounds in integer quadrati.. (context) - KAMATH, KARMARKAR - 1992
5
The Theory of Max Min (context) - DANSKIN - 1967
4
A tight bound for the boolean quadratic optimization problem.. (context) - ORNER - 1988
3
Some remarks on quadratic programming with 0-1 variables (context) - HAMMER, RUBIN - 1970
3
Trust region problems and nonsymmetric perturbation theory
- STERN, WOLKOWICZ - 1994
2
An inverse parametric eigenvalue approach to trust region pr.. (context) - RENDL - 1992
2
Nonlinear relaxations of graph-bisection problems (context) - POLJAK, RENDL - 1992
Documents on the same site (http://orion.math.uwaterloo.ca/~hwolkowi/henry/reports/ABSTRACTS.html): More
Strong Duality for a Trust-Region Type Relaxation.. - Anstreicher, Chen, .. (1998)
(Correct)
SQ^P, Sequential Quadratic Constrained Quadratic Programming - Kruk, Wolkowicz (1998)
(Correct)
Symmetrization of Nonsymmetric Quadratic Assignment.. - Hadley, Rendl, Wolkowicz (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