Masakazu Muramatsu, Robert J. Vanderbei  Home/Search
Context Related
| princeton.edu/~rvdb/ps/all.pdf 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: princeton.edu/~rvd...techreps_pdf (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we give an example of a semidefinite programming problem in which primal-dual affine-scaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a non-optimal solution, and that, for the AHO direction, even its associated continuous trajectory can converge to a non-optimal point. In contrast with these directions, we show that the primal-dual affine-scaling algorithm using the NT direction for... (Update)
Similar documents based on text: More All
2.5: Primal-Dual Affine-Scaling Algorithms Fail For.. - Muramatsu, Vanderbei (1997) (Correct)
0.8: Affine Scaling Algorithm Fails For Semidefinite Programming - Muramatsu (1997) (Correct)
0.8: Exploiting Sparsity in Primal-Dual Interior-Point.. - Fujisawa, Kojima, Nakata (1997) (Correct)
BibTeX entry: (Update)
M. Muramatsu and R. Vanderbei, "Primal-dual affine scaling algorithms fail for semidefinite programming, " Technical Report, SOR, Princeton University, Princeton, NJ, 1997. http://citeseer.ist.psu.edu/muramatsu97primaldual.html More
@article{ muramatsu99primaldual,
author = "M. Muramatsu and R. J. Vanderbei",
title = "Primal-dual affine-scaling algorithms fail for semidefinite programming",
journal = "Mathematics of Operations Research",
volume = "24(1)",
pages = "149--175",
year = "1999",
url = "citeseer.ist.psu.edu/muramatsu97primaldual.html" }
Citations (may not include all citations):448 A new polynomial time algorithm for linear programming (context) - Karmarkar - 1984
307 Interior Point Polynomial Methods in Convex Programming : Th.. (context) - Nesterov, Nemirovskii - 1993
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
173 An interior point method for semidefinite programming - Helmberg, Rendl et al. - 1996
146 Primal-dual interior-point methods for semidefinite programm.. - Alizadeh, Haeberly et al. - 1994
142 Primal-dual interior-point methods for self-scaled cones - Nesterov, Todd - 1995
121 Self-scaled barriers and interior-point methods for convex p.. (context) - Nesterov, Todd - 1995
99 Primal-dual path-following algorithms for semidefinite progr.. - Monteiro - 1995
92 the Nesterov-Todd direction in semidefinite programming - Todd, Toh et al. - 1996
90 Primal-dual potential reduction method for problems involvin.. - Vandenberghe, Boyd - 1995
79 Iterative solution of problems of linear and quadratic progr.. (context) - Dikin - 1967
78 Interior point methods for the monotone semidefinite linear .. (context) - Kojima, Shindoh et al. - 1997
55 Symmetric primal-dual path-following algorithms for semidefi.. - Sturm, Zhang - 1995
51 On extending primal-dual interior-point algorithms from line.. - Zhang - 1995
49 An interior-point method for minimizing the maximum eigenval.. (context) - Jarre - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://www.princeton.edu/~rvdb/techreps_pdf.html): More
A Case Study In Trajectory Optimization: Putting On An Uneven.. - Vanderbei (2000) (Correct)
Case Studies In Trajectory Optimization: Trains, Planes, And.. - Vanderbei (2000) (Correct)
Interior-Point Methods For Nonconvex Nonlinear.. - Benson, Shanno.. (2000) (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