Lack Of Strong A Note on Lack of Strong Duality for Quadratic Problems with Orthogonal...  Home/Search
Context
Related
| orion.math.uwaterlo...orthoglackdual.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: orion.math.uwaterloo.ca/~hwolk... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The general quadratically constrained quadratic program (QQP) is an important modelling tool for many diverse problems. The QQP is in general NP hard, and numerically intractable. Lagrangian relaxations often provide good approximate solutions to these hard problems. Such relaxations are equivalent to semide nite programming (SDP) relaxations and can be solved eciently. (Update)
Similar documents (at the sentence level):
27.0%: A Note on Lack of Strong duality for Quadratic Problems with.. - Wolkowicz (1999) (Correct)
8.7%: Semidefinite Programming Approaches To The Quadratic Assignment.. - Wolkowicz (2000) (Correct)
Active bibliography (related documents): More All
1.1: Semidefinite Programming for Discrete Optimization and.. - Wolkowicz, Anjos (2000) (Correct)
0.5: A Survey of the Trust Region Subproblem within a Semidefinite.. - Fortin (2000) (Correct)
0.5: Unknown - Ed Improved Hkm (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@techreport{ torontodidunknown,
author = "{University of Toronto}",
title = "{UNKNOWN}",
number = "CSRI-274",
url = "citeseer.ist.psu.edu/764776.html" }
Citations (may not include all citations):708 Cambridge University Press (context) - HORN, JOHNSON - 1990
90 The geometry of algorithms with orthogonality constraints - EDELMAN, ARIAS et al. - 1999
73 Quadratic assignment problems - FINKE, BURKARD et al. - 1987
38 A new lower bound via projection for the quadratic assignmen.. - HADLEY, RENDL et al. - 1992
28 A trust region strategy for nonlinear equality constrained o.. (context) - CELIS, Jr et al. - 1984
26 On Lagrangian relaxation of quadratic matrix constraints - ANSTREICHER, WOLKOWICZ - 2000
17 A new bound for the quadratic assignment problem based on co.. - ANSTREICHER, BRIXIUS - 1999
10 Richtungsfelder und fernparallelismus in n-dimensionalem man.. (context) - STIEFEL
8 Perturbation Bounds for Matrix Eigenvalues : Pitman Research.. (context) - BHATIA - 1987
4 Dual algorithms for orthogonal Procrustes rotations (context) - SHAPIRO, BOTHA - 1988
4 Semide nite programming relaxations for the quadratic assign.. (context) - ZHAO, KARISCH et al. - 1998
4 A semide nite framework for trust region subproblems with ap.. (context) - RENDL, WOLKOWICZ - 1997
3 Semide nite programming relaxations of nonconvex quadratic o.. (context) - NESTEROV, WOLKOWICZ et al. - 2000
3 Inde nite trust region subproblems and nonsymmetric eigenval.. (context) - STERN, WOLKOWICZ - 1995
3 Semide nite programming relaxations for the graph partitioni.. (context) - WOLKOWICZ, ZHAO - 1999
1 Semide nite and Lagrangian relaxations for hard combinatoria.. (context) - WOLKOWICZ - 1999
Documents on the same site (http://orion.math.uwaterloo.ca/~hwolkowi/henry/reports/): More
Regularization Using a - Parameterized Trust Region (Correct)
A Matrix-lifting Semidefinite Relaxation for the Quadratic.. - Yichuan Ding Henry (Correct)
Semidefinite Programming - Henry Wolkowicz October (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