C. Helmberg, F. Oustry  Home/Search
Context Related
| inrialpes.fr/numopt/p...helmoust.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: inrialpes.fr/numopt/pe...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper. 1.9.1 The spectral bundle method (Update)
Context of citations to this paper: More
...regularity conditions. These bundle methods are further discussed, and improved computational results given, in Helmberg and Oustry [26]. Fukuda and Kojima [19] have recently proposed an interior point method for the same class of problems, working just in the space of y to...
.... 4 The spectral bundle method The spectral bundle method is due to Helmberg and Rendl [20] Other references include Helmberg et al. [19, 21, 22] and Oustry [37] In this section we give a detailed description of the spectral bundle scheme. Since our original (SDP ) is a...
Cited by: More
Geometry of Semide - Nite Max-Cut Relaxations (Correct)
Unknown - Strengthenedsemidefiniteprogramming.. (Correct)
A Linear Programming Approach to Semidefinite Programming.. - Krishnan, Mitchell (2001) (Correct)
Active bibliography (related documents): More All
0.5: Nonsmooth Algorithms to Solve Semidefinite Programs - Lemaréchal, Oustry (1999) (Correct)
0.5: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.5: The U-Lagrangian Of The Maximum Eigenvalue Function - Oustry (1998) (Correct)
Similar documents based on text: More All
0.3: Semidefinite Programming - Helmberg (1999) (Correct)
0.3: A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations - Helmberg (2001) (Correct)
0.3: A Spectral Bundle Method with Bounds - Helmberg, Kiwiel (1999) (Correct)
Related documents from co-citation: More All
6: A spectral bundle method for semidefinite programming - Helmberg, Rendl - 1997
5: Solving Semidefinite Programs via Nonlinear Programming - Burer, Monteiro et al. - 1999
5: Interior-Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovskii - 1994
BibTeX entry: (Update)
C. Helmberg and F. Oustry. Bundle methods to minimize the maximum eigenvalue function. In Lieven Vandenberghe R. Saigal and H. Wolkovicz, editors, Hanbook on Semidefinite Programming. Theory, Algorithms and Applications. Kluwer Academic Publisher, 1999. To appear. http://citeseer.ist.psu.edu/helmberg99bundle.html More
@incollection{ helmberg00bundle,
author = "C. {HELMBERG} and F. {OUSTRY}",
title = "Bundle methods to minimize the maximum eigenvalue function",
booktitle = "{HANDBOOK} {OF} {SEMIDEFINITE} {PROGRAMMING}: Theory, Algorithms, and Applications",
publisher = "Kluwer Academic Publishers",
address = "Boston, MA",
editor = "H. Wolkowicz and R. Saigal and L. Vandenberghe",
year = "2000",
url = "citeseer.ist.psu.edu/helmberg99bundle.html" }
Citations (may not include all citations):640 Princeton University Press (context) - Rockafellar, Analysis - 1970
326 Topics in Matrix Analysis (context) - Horn, Johnson - 1991
234 Numerical Methods for Large Eigenvalue Problems (context) - Saad - 1992
99 Approximate graph coloring by semidefinite programming - Karger, Motwani et al. - 1994
76 A version of the bundle idea for minimizing a nonsmooth func.. (context) - Schramm, Zowe - 1992
60 IEEE Transactions on Information Theory (context) - aszl, Lov et al. - 1979
49 Large-scale optimization of eigenvalues - Overton - 1992
47 On minimizing the maximum eigenvalue of a symmetric matrix (context) - Overton - 1988
39 Optimality conditions and duality theory for minimizing sums.. - Overton, Womersley - 1993
35 Nonpolyhedral relaxations of graph-bisection problems - Poljak, Rendl - 1995
28 Second derivatives for optimizing eigenvalues of symmetric m.. (context) - Overton, Womersley - 1995
28 First and second order analysis of nonlinear semidenite prog.. - Shapiro - 1997
23 Implicit application of polynomial lters in a k-step Arnoldi.. (context) - Sorensen - 1992
18 On eigenvalue optimization (context) - Shapiro, Fan - 1995
15 A spectral bundle method for semidenite programming (context) - Helmberg, Rendl - 1997
15 A second-order bundle method to minimize the maximum eigenva.. - Oustry - 1998
13 Lagrangian of the maximum eigenvalue function (context) - Oustry - 1998
10 Originally published in Tekhnicheskaya Kibernetika (context) - Shor, problems et al. - 1987
8 An aggregate subgradient method for nonsmooth convex minimiz.. (context) - Kiwiel - 1983
7 Proximity control in bundle methods for convex nondi erentia.. (context) - Kiwiel - 1990
5 Sensivity analysis of all eigenvalues of a symmetric matrix (context) - Hiriart-Urruty, Ye - 1995
2 Convex Analysis and Minimization Algorithms II (context) - Hiriart-Urruty, Lemar - 1993
1 Global and superlinear convergence of an algorithm for one-d.. (context) - Lemar, Mi - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.inrialpes.fr/numopt/people/foustry/research.html): More
Nonsmooth Algorithms to Solve Semidefinite Programs - Lemaréchal, Oustry (1999) (Correct)
Vertical Developments Of A Convex Function - Oustry (1997) (Correct)
A Cone Complementarity Linearization Algorithm for Static .. - Ghaoui, Oustry, AitRami (1997) (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