M.J. Todd  Home/Search
Context Related
| cornell.edu/~miketodd/soa4.ps.Z 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: cornell.edu/~miket...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Optimization problems in which the variable is not a vector but a symmetric matrix which is required to be positive semidefinite have been intensely studied in the last ten years. Part of the reason for the interest stems from the applicability of such problems to such diverse areas as designing the strongest column, checking the stability of a di#erential inclusion, and obtaining tight bounds for hard combinatorial optimization problems. Part also derives from great advances in our ability to... (Update)
Cited by: More
Research Reports on - Mathematical And Computing (Correct)
Extensions of Lo's semiparametric bound for - European Call Options (Correct)
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
Active bibliography (related documents): More All
2.1: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.9: A Study of Search Directions in Primal-Dual Interior-Point Methods .. - Todd (1998) (Correct)
0.8: A Nonlinear Programming Algorithm for Solving Semidefinite.. - Burer, Monteiro (2001) (Correct)
Similar documents based on text: More All
0.4: Semidefinite Programming Duality and Linear.. - Balakrishnan.. (2003) (Correct)
0.2: Least Squares Reconstruction of Binary Signals Using.. - Chrétien, Corset (2002) (Correct)
0.2: The Many Facets of Linear Programming - Todd (2002) (Correct)
Related documents from co-citation: More All
4: Interior Point Algorithms: Theory and Analysis (context) - Ye - 1997
4: HANDBOOK OF SEMIDEFINITE PROGRAMMING: Theory (context) - WOLKOWICZ, SAIGAL et al. - 2000
3: Primal-dual interior-point methods for semidefinite programming - Alizadeh, Haeberly et al. - 1994
BibTeX entry: (Update)
M.J. Todd, "Semidefinite optimization," Acta Numerica 10 (2001) 515--560. http://citeseer.ist.psu.edu/todd01semidefinite.html More
@techreport{ todd01semidefinite,
author = "M. J. Todd",
title = "Semidefinite Optimization",
address = "Ithaca, NY 14853",
year = "2001",
url = "citeseer.ist.psu.edu/todd01semidefinite.html" }
Citations (may not include all citations):640 Princeton University Press (context) - Rockafellar - 1970
529 Linear Matrix Inequalities in System and Control Theory (context) - Boyd, Ghaoui et al. - 1994
448 A new polynomial-time algorithm for linear programming (context) - Karmarkar - 1984
415 Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lovasz et al. - 1988
326 Interior Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovski - 1994
276 Semidefinite programming - Vandenberghe, Boyd - 1996
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. - 1998
142 Primal-dual interior-point methods for self-scaled cones - Nesterov, Todd - 1998
121 Self-scaled barriers and interior-point methods for convex p.. (context) - Nesterov, Todd - 1997
99 Primal-dual path-following algorithms for semidefinite progr.. - Monteiro - 1997
93 IEEE Transactions on Information Theory (context) - Lovasz, Shannon et al. - 1979
92 the Nesterov-Todd direction in semidefinite programming - Todd, Toh et al. - 1998
82 Lower bounds for the partitioning of graphs (context) - Donath, Ho - 1973
78 Interior-point methods for the monotone semidefinite linear .. (context) - Kojima, Shindoh et al. - 1997
71 Solving large-scale sparse semidefinite programs for combina.. - Benson, Ye et al. - 2000
57 Eigenvalue optimization - Lewis, Overton - 1996
55 A spectral bundle method for semidefinite programming - Helmberg, Rendl - 2000
49 Semidefinite programming in combinatorial optimization - Goemans - 1997
46 Laplacian eigenvalues and the maximum cut problem (context) - Delorme, Poljak - 1993
40 Superlinear convergence of a symmetric primal-dual path-foll.. - Luo, Sturm et al. - 1998
39 Polynomial convergence of primal-dual algorithms for semidef.. - Monteiro - 1998
39 Optimality conditions and duality theory for minimizing sums.. - Overton, Womersley - 1993
38 iteration homogeneous and selfdual linear programming algori.. (context) - Ye, Todd et al. - 1994
34 On extending some primal-dual interior-point algorithms from.. - Zhang - 1998
33 Solving semidefinite programs via nonlinear programming II: .. - Burer, Monteiro et al. - 1999
30 Strong duality for semidefinite programming - Ramana, Tuncel et al. - 1997
30 Semi-definite matrix constraints in optimization (context) - Fletcher - 1985
29 An exact duality theory for semidefinite programming and its.. - Ramana - 1997
28 Dual quadratic estimates in polynomial and Boolean programmi.. (context) - Shor - 1990
27 Cones of matrices and set-functions and 0-1 optimization (context) - Lovasz, Schrijver - 1991
25 A recipe for semidefinite relaxation (context) - Poljak, Rendl et al. - 1995
24 On homogeneous interior-point algorithms for semidefinite pr.. - Potra, Sheng - 1998
21 A centered projective algorithm for linear programming (context) - Todd, Ye - 1990
19 Interior point trajectories in semidefinite programming - Goldfarb, Scheinberg - 1998
19 Linear systems in Jordan algebras and primal-dual interior-p.. - Faybusovich - 1997
19 Exploiting sparsity in semidefinite programming via matrix c.. - Fukuda, Kojima et al. - 2000
19 Centered Newton method for mathematical programming (context) - Tanabe - 1988
18 A new primal-dual interiorpoint method for semidefinite prog.. - Alizadeh, Haeberly et al. - 1994
18 Robust convex optimization (context) - Ben-Tal, Nemirovski - 1998
15 A second-order bundle method to minimize the maximum eigenva.. - Oustry - 2000
13 Search directions in the SDP and the monotone SDLCP: general.. - Kojima, Shida et al. - 1999
13 Lagrangian of the maximum eigenvalue function (context) - Oustry - 1999
13 Interior point algorithms for semidefinite programming based.. - Burer, Monteiro et al. - 1999
12 A note on the existence of the AlizadehHaeberly -Overton dir.. - Monteiro, Zanjacomo - 1997
11 On systems of linear inequalities in Hermitian matrix variab.. (context) - Bellman, Fan - 1963
11 Conic formulation of a convex programming problem and dualit.. (context) - Nesterov, Nemirovski - 1992
10 Euclidean Jordan algebras and interior-point algorithms (context) - Faybusovich - 1997
10 A nonlinear programming problem in statistics (context) - Fletcher - 1981
10 On formulating semidefinite programming problems as smooth c.. - Vanderbei, Benson - 1999
9 Bundle methods to minimize the maximum eigenvalue function - Helmberg, Oustry - 2000
8 Maximum cuts and largest bipartite subgraphs (context) - Poljak, Tuza - 1995
8 Initialization in semidefinite programming via a self-dual s.. - de Klerk, Roos et al. - 1997
8 A unified analysis for a class of long-step primaldual path-.. - Monteiro, Zhang - 1998
7 Conic convex programming and self-dual embedding - Luo, Sturm et al. - 2000
7 Handbook of Semidefinite Programming (context) - Wolkowicz, Saigal et al. - 2000
6 Path-following methods (context) - Monteiro, Todd - 2000
4 Semidefinite programming home page (context) - Helmberg
3 A QQP-minimization method for semidefinite and smooth noncon.. - Jarre - 1999
3 Semidefinite programming home page (context) - Alizadeh
3 cient computation of the gradient in semidefinite programmin.. (context) - Vavasis, on - 1999
3 potential reduction methods and word-by-word extensions (context) - Alizadeh, Schmieta - 2000
2 Potential reduction and primal-dual methods (context) - Tuncel - 2000
2 A study of search directions in interior-point methods for s.. (context) - Todd - 1999
2 Interior-point methods for Lagrangian duals of semidefinite .. - Fukuda, Kojima - 2000
1 The minimization of certain nondi#erentiable sums of eigenva.. (context) - Cullum, Donath et al. - 1975
1 Bibliography on semidefinite programming (context) - Wolkowicz
1 Interior-point methods online home page (context) - Wright
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.orie.cornell.edu/~miketodd/publications.html): More
Primal-Dual Interior-Point Methods for Self-Scaled Cones - Nesterov, Todd (1995) (Correct)
Monotonicity Of Primal And Dual Objective Values In.. - Mizuno, Todd.. (1994) (Correct)
SDPT3 - a MATLAB software package for semidefinite programming - Toh, Todd, Tütüncü (1998) (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