Is Linear 1 date: June 1, 1998 file: duality Duality For Semidefinite Programming, Sdp...  Home/Search
Context
Related
| orion.math.uwaterl...ualityencycl.ps.gz 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....ABSTRACTS (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 29.77> X0 max y L(X; y) = C ffl X + y t (b \Gamma AX): The equivalence can be seen by using the hidden constraint in the outer minimization problem b \Gamma AX = 0; i.e. if this constraint does not hold then the inner maximum value is +1: By interchanging the max and the min and rewriting the order of terms in the Lagrangian, we get the dual problem and weak duality. ¯ := max y min X0 b t y + (C \Gamma A y) ffl X: Using the hidden constraint in the outer ... (Update)
Active bibliography (related documents): More All
0.6: The Gauss-Newton Direction in Semidefinite Programming - Kruk, Muramatsu, Rendl.. (1998) (Correct)
0.4: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.3: Presolving for Semidefinite Programs Without.. - Gruber, Kruk, Rendl, .. (1998) (Correct)
Similar documents based on text: More All
0.1: Foreword: for Special Issue on Semidefinite Programming - Overton, Wolkowicz (Correct)
0.1: Semidefinite Programming for Discrete Optimization and.. - Wolkowicz, Anjos (2000) (Correct)
0.1: Semidefinite Programming for Assignment and Partitioning Problems - Zhao (1996) (Correct)
BibTeX entry: (Update)
@misc{ linear-gamma,
author = "Is Linear",
title = "\Gamma! !",
url = "citeseer.ist.psu.edu/42578.html" }
Citations (may not include all citations):44 An algorithmic analysis of multiquadratic and semidefinite p.. (context) - RAMANA - 1993 ACM
40 Theory of linear programming (context) - Goldman, Tucker - 1956
35 Some applications of optimization in matrix theory (context) - WOLKOWICZ - 1981
35 Semidefinite programming relaxations for the quadratic assig.. - ZHAO, KARISCH et al. - 1998 DBLP
30 Strong duality for semidefinite programming - RAMANA, TUNCEL et al. - 1997 ACM
28 First and second order analysis of nonlinear semidefinite pr.. - SHAPIRO - 1997 ACM
20 An interior-point method for approximate positive semidefini.. - JOHNSON, KROSCHEL et al. - 1998
17 Polyhedral convex cones (context) - Goldman, Tucker - 1956
16 Interior point methods for semidefinite programming (context) - KLERK - 1997
16 Characterizations of optimality for the abstract convex prog.. (context) - BORWEIN, WOLKOWICZ - 1981
14 the generic properties of convex optimization problems in co.. - PATAKI, TUNCEL - 1997
14 Regularizing the abstract convex program (context) - BORWEIN, WOLKOWICZ - 1981
3 An interior-point method for approximate distance matrix com.. (context) - ALFAKIH, KHANDANI et al. - 1997
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