E. de Klerk, C. Roos, T. Terlaky  Home/Search
Context
Related
| cas.mcmaster.ca/~t...uttwi9728.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: cas.mcmaster.ca/~terlaky/files... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Semidefinite programming (SDP) is one of the fastest developing branches of mathematical programming. The reason is twofold: efficient solution algorithms for SDP have come to light in the past few years, and SDP finds applications in combinatorial optimization and engineering. In this short survey we show how SDP duality theory can be used to prove classical results, and review the development of interior point algorithms for SDP. Key words: interior--point method, semidefinite programming 1... (Update)
Active bibliography (related documents): More All
1.7: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
1.5: On Primal-Dual Path-Following Algorithms in Semidefinite.. - Terlaky (1996) (Correct)
1.0: Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite.. - Terlaky (1996) (Correct)
Similar documents based on text: More All
0.4: Terlaky, J. Valkó, J.E. Hoogenboom.. - de Klerk.. (1994) (Correct)
0.4: Method of Approximate Centers for Semi-Definite Programming - He, de Klerk, Roos, Terlaky (1996) (Correct)
0.4: Infeasible Start Semidefinite Programming Algorithms Via.. - de Klerk, Roos, Terlaky (1997) (Correct)
BibTeX entry: (Update)
@incollection{ klerk97short,
author = "{E. de} Klerk and C. Roos and T. Terlaky",
title = "A short survey on semidefinite programming",
booktitle = "{Ten Years {LNMB}, Ph.d. Research and Graduate Courses of the Dutch Network of Operations Research}",
volume = "122",
publisher = "Centrum for Mathematics and Informatics (CWI)",
address = "Amsterdam, The Netherlands",
editor = "W. K. Klein Haneveld et al.",
pages = "323--339",
year = "1997",
url = "citeseer.ist.psu.edu/deklerk97short.html" }
Citations (may not include all citations):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, Lov'asz et al. - 1988
326 Interior point polynomial algorithms in convex programming (context) - Nesterov, Nemirovskii - 1994
276 Semidefinite programming - Vandenberghe, Boyd - 1996
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
186 Primal--dual interior point methods (context) - Wright - 1997
173 An interior-point method for semidefinite programming - Helmberg, Rendl et al. - 1996
121 Self--scaled barriers and interior--point methods for convex.. (context) - Nesterov, Todd - 1994
92 the Nesterov-Todd direction in semidefinite programming - Todd, Toh et al. - 1996
78 Interior point methods for the monotone semidefinite linear .. (context) - Kojima, Shindoh et al. - 1994
72 Cones of matrices and set--functions and 0-1 optimization (context) - Lov'asz, Schrijver - 1991
60 Combinatorial optimization with interior point methods and s.. (context) - Alizadeh - 1991
57 Theory and Algorithms for Linear Optimization: An interior p.. (context) - Roos, Terlaky et al. - 1997
56 the Shannon capacity of a graph (context) - Lov'asz - 1979
55 Symmetric primal--dual path following algorithms for semidef.. - Sturm, Zhang - 1995
51 On extending primal-dual interior point algorithms from line.. - Zhang - 1995
47 A superlinearly convergent primal--dual infeasible--interior.. - Potra, Sheng - 1995
40 Approximating quadratic programming with bound constraints - Ye - 1997
35 Quadratic optimization problems (context) - Shor - 1987
29 An exact duality theory for semidefinite programming and its.. - Ramana - 1997
27 Quality of semidefinite relaxation for nonconvex quadratic o.. (context) - Nesterov - 1997
27 Existence of search directions in interior--point algorithms.. - Shida, Shindoh et al. - 1996
20 Global and local convergence of predictor-corrector infeasib.. - Kojima, Shida et al. - 1995
19 Interior point trajectories in semidefinite programming - Goldfarb, Scheinberg - 1996
18 Duality and self-duality for conic convex programming - Luo, Sturm et al. - 1996
15 A long--step path following algorithm for semidefinite progr.. (context) - Anstreicher, Fampa - 1996
13 A predictor-corrector interior point algorithm for the semid.. - Kojima, Shidah et al. - 1996
13 a matrix generalization of affine--scaling vector fields (context) - Faybusovich - 1995
12 Initialization in semidefinite programming via a self--dual - de Klerk, Roos et al. - 1996
11 Potential reduction polynomial time method for truss topolog.. (context) - Ben-Tal, Nemirovskii - 1994
11 Linear programming with matrix variables (context) - Craven, Mond - 1981
11 On systems of linear inequalities in hermitian matrix variab.. (context) - Bellman, Fan - 1963
10 Nonlinear Programming: Theory and Algorithms (context) - Bazarraa, Sherali et al. - 1993
10 Polynomial primal--dual affine scaling algorithms in semidef.. - de Klerk, Roos et al. - 1996
10 Semi--definite programming: a path--following algorithm for .. (context) - Faybusovich - 1996
10 Primal-dual algorithms for semidefinite programming (context) - Monteiro - 1995
10 A long step primal--dual path following method for semidefin.. (context) - Jiang - 1996
9 Interior point methods: current status and future directions - Freund, Mizuno - 1996
8 Optimization of Structural Topology (context) - Bendse - 1995
8 Optimization methods for truss geometry and topology design (context) - Bendse, Ben-Tal et al. - 1994
8 Semidefinite programming (context) - Ramana, Pardalos - 1996
8 Affine scaling algorithm fails for semidefinite programming - Muramatsu - 1996
5 Semi--definite problems in truss topology optimization - de Klerk, Roos et al. - 1995
5 Interior-point methods for classes of convex programs (context) - Jarre - 1996
4 Primal-dual affine-scaling algorithm fails for semidefinite .. - Muramatsu, Vanderbei - 1997
4 A primal--dual potential reduction algorithm for problems in.. (context) - Vandenberghe, Boyd - 1995
4 Optimal truss design by interior point methods (context) - Jarre, Kocvara et al. - 1996
4 Method of approximate centers for semi--definite programming - He, de Klerk et al. - 1996
4 On primal--dual path--following algorithms in semidefinite p.. - de Klerk, Roos et al. - 1996
3 A finite element method for the optimal design of variable t.. (context) - Rossow, Taylor - 1973
3 On finding the optimal distribution of material properties (context) - Ringertz - 1993
3 the long step path--following method for semidefinite progra.. - Sturm, Zhang - 1996
3 Primal-dual methods for semidefinite programming: convergenc.. (context) - Alizadeh, Haeberley et al. - 1996
2 Interior point polynomial time methods in convex programming (context) - Nemirovskii - 1994
2 Superlinear convergence oa a Symmetric primal--dual path fol.. (context) - Luo, Sturm et al. - 1996
1 Interior point methods: a decade after Karmarkar (context) - Jansen, Roos et al. - 1995
1 Using semi--definite programming for controller design in ac.. (context) - Olkin - 1996
Documents on the same site (http://www.cas.mcmaster.ca/~terlaky/files/): More
Edmonds Fukuda Rule And A General Recursion For Quadratic.. - Fukuda, Terlaky (Correct)
A Potential Reduction Method for a Class of Smooth.. - den Hertog, Roos.. (1990) (Correct)
The Finite Criss-Cross Method for Hyperbolic Programming - Illes, Szirmai, Terlaky (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