See this document in CiteSeerX!

Semidefinite and Cone Programming Bibliography/Comments (2004)  (Make Corrections)  
Henry Wolkowicz



  Home/Search   Context   Related

 
View or download:
orion.math.uwaterloo.c...sdpbibliog.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  orion.math.uwaterloo.ca/...readme (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This online technical report presents abstracts (short outlines) of papers related to semidefinite programming. The papers are grouped by subject... (Update)

Similar documents (at the sentence level):
38.2%:   Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2001)   (Correct)

Active bibliography (related documents):   More   All
8.2:   Semidefinite and Lagrangian Relaxations for Hard Combinatorial.. - Wolkowicz (1999)   (Correct)
6.9:   Optimal Inequalities in Probability Theory: A Convex.. - Bertsimas, Popescu (2000)   (Correct)
6.0:   Presolving for Semidefinite Programs Without.. - Gruber, Kruk, Rendl, .. (1998)   (Correct)

Similar documents based on text:   More   All
0.1:   Unknown -   (Correct)
0.1:   Trust Regions and Relaxations for the Quadratic Assignment .. - Karisch, Rendl, Wolkowicz (1993)   (Correct)

BibTeX entry:   (Update)

@misc{ wolkowicz-semidefinite,
  author = "Henry Wolkowicz",
  title = "Semidefinite and Cone Programming Bibliography/Comments",
  url = "citeseer.ist.psu.edu/article/wolkowicz04semidefinite.html" }
Citations (may not include all citations):
2441   Johns Hopkins University Press (context) - GOLUB, VAN LOAN - 1996
773   Reducibility among combinatorial problems (context) - KARP - 1972
663   Practical Optimization (context) - GILL, MURRAY et al. - 1981
640   Princeton University Press (context) - ROCKAFELLAR - 1970
624   The Algebraic Eigenvalue Problem (context) - WILKINSON - 1965  ACM
529   Linear Matrix Inequalities in System and Control Theory (context) - BOYD, GHAOUI et al. - 1994
518   Integer and Combinatorial Optimization (context) - NEMHAUSER, WOLSEY - 1988
448   A new polynomial time algorithm for linear programming (context) - KARMARKAR - 1984
415   Improved approximation algorithms for maximum cut and satisf.. - GOEMANS, WILLIAMSON - 1995
326   Topics in matrix analysis (context) - HORN, JOHNSON - 1994  ACM
326   Interior Point Polynomial Algorithms in Convex Programming (context) - NESTEROV, NEMIROVSKI - 1994
313   Matrix Perturbation Theory (context) - STEWART, SUN - 1990
306   Methods of Mathematical Physics (context) - COURANT, HILBERT - 1953
306   Inequalities: Theory of Majorization and its Applications (context) - MARSHALL, OLKIN - 1979
276   Semidefinite programming - VANDENBERGHE, BOYD - 1996  ACM
262   Global optimization using interval analysis (context) - HANSEN - 1992
251   Reversibility and Stochastic Networks (context) - KELLY - 1979
250   Optimization by Vector Space Methods (context) - LUENBERGER - 1969  ACM
234   Numerical Methods for Large Eigenvalue Problems (context) - SAAD - 1992
230   Interior point methods in semidefinite programming with appl.. - ALIZADEH - 1995
204   Methods and Applications of Interval Analysis (context) - MOORE - 1979
186   Primal-Dual Interior-Point Methods (context) - WRIGHT - 1996  ACM
178   Robust and Optimal Control (context) - with, DOYLE et al. - 1996  ACM
173   An interior-point method for semidefinite programming - HELMBERG, RENDL et al. - 1996
173   An interior-point method for semidefinite programming and ma.. - HELMBERG - 1994
172   Nonlinear programming sequential unconstrained minimization .. (context) - FIACCO, McCORMICK - 1990
172   Nonlinear Programming: Sequential Unconstrained Minimization.. (context) - FIACCO, McCORMICK - 1968
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  ACM
141   Martingales and arbitrage in multiperiod securities markets (context) - HARRISON, KREPS - 1979
140   Interior path following primal-dual algorithms (context) - MONTEIRO, ADLER - 1989  ACM
140   Interior path following primal-dual algorithms (context) - MONTEIRO, ADLER - 1989  ACM
139   Implicit application of polynomial filters in a k-step Arnol.. (context) - SORENSEN - 1992
121   Self-scaled barriers and interior-point methods for convex p.. (context) - NESTEROV, TODD - 1997  ACM
120   Some optimal inapproximability results (context) - HASTAD - 1997  ACM   DBLP
117   A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - BALAS, CERIA et al. - 1993  ACM
116   A Unified Approach to Interior Point Algorithms for Linear C.. - KOJIMA, MEGIDDO et al. - 1991
112   Improved approximation algorithms for MAX k-CUT and MAX BISE.. - FRIEZE, JERRUM - 1995  ACM   DBLP
112   Improved approximation algorithms for MAX k-CUT and MAX BISE.. - FRIEZE, JERRUM - 1997  ACM   DBLP
110   Feedback Systems: Input-Output Properties (context) - DESOER, VIDYASAGAR - 1975
110   the computational complexity and geometry of the first-order.. (context) - RENEGAR - 1992
108   Introduction to the Theory of Computation (context) - SIPSER - 1996  ACM
108   Algebraic connectivity of graphs (context) - FIEDLER - 1973
106   approximation algorithms for MAX CUT and MAX 2SAT (context) - GOEMANS, WILLIAMSON - 1994
102   The total least squares problem: computational aspects and a.. (context) - VAN HUFFEL, VANDEWALLE - 1991
101   Pathways to the optimal set in linear programming (context) - MEGIDDO - 1988  ACM
99   Approximate graph coloring by semidefinite programming - KARGER, MOTWANI et al. - 1998  ACM   DBLP
99   Primal-dual path-following algorithms for semidefinite progr.. - MONTEIRO - 1997
98   Computing a trust region step (context) - MOR, SORENSEN - 1983
97   Analysis of feedback systems with structured uncertainties (context) - DOYLE - 1982
92   the Nesterov-Todd direction in semidefinite programming - TODD, TOH et al. - 1998
90   The geometry of algorithms with orthogonality constraints - EDELMAN, ARIAS et al. - 1999
90   A primal-dual potential reduction method for problems involv.. - VANDENBERGHE, BOYD - 1995  ACM
88   Eigenvalues and graph bisection: An average case analysis (context) - BOPPANA - 1987
85   On adaptive-step primal-dual interior-point algorithms for l.. (context) - MIZUNO, TODD et al. - 1993  ACM
85   A primal--dual interior point algorithm for linear programmi.. (context) - KOJIMA, MIZUNO et al. - 1989
85   the approximation of maximum satisfiability (context) - YANNAKAKIS - 1994
82   Lower bounds for the partitioning of graphs (context) - DONATH, HOFFMAN - 1973
81   a MATLAB toolbox for optimization over symmetric cones (context) - STURM - 1999
78   Interior-point methods for the monotone semidefinite linear .. (context) - KOJIMA, SHINDOH et al. - 1997  ACM
77   Gain scheduling via linear fractional transformations (context) - PACKARD - 1994
76   The valuation of options for alternative stochastic processe.. (context) - COX, ROSS - 1976
76   A version of the bundle idea for minimizing a nonsmooth func.. (context) - SCHRAMM, ZOWE - 1992
73   Quadratic assignment problems - FINKE, BURKARD et al. - 1987
73   A polynomial time algorithm for a class of linear complement.. (context) - KOJIMA, MIZUNO et al. - 1989
72   Cones of matrices and set-functions and 0-1 optimization (context) - ASZ, SCHRIJVER - 1991
71   Solving large-scale sparse semidefinite programs for combina.. - BENSON, YE et al. - 2000  ACM
69   Determinant maximization with linear matrix inequality const.. - VANDENBERGHE, BOYD et al. - 1998  ACM
69   Implied binomial trees (context) - RUBINSTEIN - 1994
68   Robustness in the presence of mixed parametric uncertainty a.. (context) - FAN, TITS et al. - 1991
68   Analysis on Symmetric Cones (context) - FARAUT, KORANYI - 1994
67   Applications of second-order cone programming (context) - LOBO, VANDENBERGHE et al. - 1998
66   Method of centers for minimizing generalized eigenvalues - BOYD, GHAOUI - 1993
66   Elements of Queueing Theory: Palm-Martingale Calculus and St.. (context) - BACCELLI, EMAUD - 1994
65   Interior Point Algorithms: Theory and Analysis (context) - YE - 1997
64   Exploiting sparsity in primal-dual interior-point methods fo.. - FUJISAWA, KOJIMA et al. - 1997  ACM
64   Pricing with a smile (context) - DUPIRE - 1994
64   An interior point algorithm for nonconvex nonlinear programm.. - VANDERBEI, SHANNO - 1997
63   Stochastic Models of Manufacturing Systems (context) - BUZACOTT, SHANTHIKUMAR - 1993
60   A Survey of Matrix Theory and Matrix Inequalities (context) - MARCUS, MINC - 1992
60   IEEE Transactions on Information Theory (context) - ASZ, Shannon et al. - 1979
60   Nonlinear programming (context) - KUHN, TUCKER - 1950
60   Combinatorial optimization with interior point methods and s.. (context) - ALIZADEH - 1991
59   Introduction to Linear Optimization (context) - BERTSIMAS, TSITSIKLIS - 1997  ACM
59   Sequential quadratic programming - BOGGS, TOLLE - 1995
57   Eigenvalue optimization - LEWIS, OVERTON - 1996
57   Theory and Algorithms for Linear Optimization: An interior P.. (context) - ROOS, TERLAKY et al. - 1997
57   Extremum problems with inequalities as subsidiary conditions (context) - JOHN - 1948
57   Constrained global optimization: Algorithms and applications (context) - PARDALOS, ROSEN - 1987
57   On approximate solutions of systems of linear inequalities (context) - HOFFMAN - 1952
56   Implementation of interior-point methods for large scale lin.. - ANDERSEN, GONDZIO et al. - 1996
55   Symmetric primal-dual path following algorithms for semidefi.. - STURM, ZHANG - 1999
55   approximation algorithm for MAX 3SAT - KARLOFF, ZWICK - 1997
55   A spectral bundle method for semidefinite programming - HELMBERG, RENDL - 2000  ACM
54   System analysis via integral quadratic constraints - MEGRETSKI, RANTZER - 1997
53   Geometry of cuts and metrics (context) - DEZA, LAURENT - 1997
52   Distance Geometry and Molecular Conformation (context) - CRIPPEN, HAVEL - 1988
52   The Classical Moment Problem (context) - AKHIEZER - 1965
51   Nonlinear Optimization: Complexity Issues (context) - VAVASIS - 1991
51   Least squares stationary optimal control and the algebraic R.. (context) - WILLEMS - 1971
50   A hierarchy of relaxations between the continuous and convex.. (context) - SHERALI, ADAMS - 1990
49   Duality and linear programs for stability and performance an.. - KUMAR, MEYN - 1996
49   An interior point method for minimizing the maximum eigenval.. (context) - JARRE - 1993
49   Semidefinite programming in combinatorial optimization - GOEMANS - 1997  ACM
49   Large-scale optimization of eigenvalues - OVERTON - 1992  ACM
48   Robust solutions to least-squares problems with uncertain da.. - GHAOUI, LEBRET - 1997  ACM
48   Self-concordant functions and polynomial time methods in con.. (context) - NESTEROV, NEMIROVSKI - 1990
48   Self--concordant functions and polynomial--time methods in c.. (context) - NESTEROV, NEMIROVSKI - 1989
48   Robust solutions to least squares problems with uncertain da.. - GHAOUI, LEBRET - 1996
47   A superlinearly convergent primal-dual infeasible-interior-p.. - POTRA, SHENG - 1995  ACM
47   A trust region method based on interior point techniques for.. - BYRD, GILBERT et al. - 1996
47   Performance bounds for queueing networks and scheduling poli.. - KUMAR, KUMAR - 1994
47   Complementarity and nondegeneracy in semidefinite programmin.. - ALIZADEH, HAEBERLY et al. - 1997
47   On minimizing the maximum eigenvalue of a symmetric matrix (context) - OVERTON - 1988
46   Optimization of multiclass queueing networks: polyhedral and.. (context) - BERTSIMAS, Ch et al. - 1994
46   Laplacian eigenvalues and the maximum cut problem (context) - DELORME, POLJAK - 1993  ACM
45   The ellipsoid method and its consequences in combinatorial o.. (context) - OTSCHEL, ASZ et al. - 1981  DBLP
45   A linear matrix inequality approach to H # control (context) - GAHINET, APKARIAN - 1994
44   An Algorithmic Analysis of Multiquadratic and Semidefinite P.. (context) - RAMANA - 1993  ACM
44   The quadratic assignment problem: a survey and recent develo.. - PARDALOS, RENDL et al. - 1993
43   iteration potential reduction algorithm for linear complemen.. (context) - KOJIMA, MIZUNO et al. - 1991
43   The Fritz John necessary optimality conditions in the presen.. (context) - MANGASARIAN, FROMOVITZ - 1967
42   Primal-dual interior methods for nonconvex nonlinear program.. (context) - FORSGREN, GILL - 1996  ACM
41   Semidefinite relaxation and nonconvex quadratic optimization (context) - NESTEROV - 1998
41   Combinatorial Matrix Theory (context) - BRUALDI, RYSER - 1991
41   A projection technique for partitioning the nodes of a graph - RENDL, WOLKOWICZ - 1995
41   Semidefinite relaxation and nonconvex quadratic optimization (context) - NESTEROV - 1998
40   Superlinear convergence of a symmetric primal-dual path-foll.. - LUO, STURM et al. - 1998
40   Structured semidefinite programs and semialgebraic geometry .. - PARRILO - 2000
40   Approximating quadratic programming with bound and quadratic.. - YE - 1999
40   Theory of linear programming (context) - GOLDMAN, TUCKER - 1956
39   Polynomial convergence of primal-dual algorithms for the sec.. - MONTEIRO, TSUCHIYA - 1998
39   Polynomial convergence of primal-dual algorithms for semidef.. - MONTEIRO - 1998  ACM
39   A trust region algorithm for equality constrained minimizati.. (context) - VARDI - 1985
39   Optimality conditions and duality theory for minimizing sums.. - OVERTON, WOMERSLEY - 1993  ACM
38   iteration homogeneous and self--dual linear programming algo.. (context) - YE, TODD et al. - 1994
38   Outward rotations: A tool for rounding solutions of semidefi.. - ZWICK - 1999
38   A new lower bound via projection for the quadratic assignmen.. - HADLEY, RENDL et al. - 1992  ACM
38   Some perturbation theory for linear programming - RENEGAR - 1994  ACM
37   A polynomial-time algorithm (context) - RENEGAR - 1988
37   Some NP-complete problems in quadratic and nonlinear program.. (context) - MURTY, KABADI - 1987  ACM
36   Distributions in Statistics: Continuous Multivariate Distrib.. (context) - JOHNSON, KOTZ - 1972
36   library for semidefinite programming (context) - BORCHERS - 1999
36   Finding a maximum cut of a planar graph in polynomial time (context) - HADLOCK - 1975  DBLP
36   A primal-dual interior method for nonconvex nonlinear progra.. (context) - GAY, OVERTON et al. - 1997
36   Riding on the smile (context) - DERMAN, KANI - 1994
36   An application of combinatorial optimization to statistical .. (context) - BARAHONA, OTSCHEL et al. - 1988  ACM
36   The complexity of approximating a nonlinear program - BELLARE, ROGAWAY - 1995  ACM
35   Semidefinite programming relaxations for the quadratic assig.. - ZHAO, KARISCH et al. - 1998  DBLP
35   Some applications of optimization in matrix theory (context) - WOLKOWICZ - 1981
35   Quadratic optimization problems (context) - SHOR - 1987
35   Nonpolyhedral relaxations of graph-bisection problems - POLJAK, RENDL - 1995
35   Applications of parametric programming and eigenvalue maximi.. (context) - RENDL, WOLKOWICZ - 1992  ACM
34   On extending some primal-dual interior-point algorithms from.. - ZHANG - 1998
34   Truncated Newton algorithms for large scale unconstrained op.. (context) - DEMBO, STEIHAUG - 1983
34   The logarithmic potential method of convex programming (context) - FRISCH - 1955
34   Theory and method (context) - TORGERSON - 1952
33   Conjugate Duality and Optimization (context) - ROCKAFELLAR - 1974
33   Solving semidefinite programs via nonlinear programming part.. - BURER, MONTEIRO et al. - 1999
32   approximation algorithm for max-bisection - YE - 1999
32   semidefinite programming algorithm user's manual (context) - FUJISAWA, KOJIMA et al. - 1998
31   Cones of matrices and successive convex relaxations of nonco.. - KOJIMA, TUNCEL - 2000  ACM
31   Analysis and Synthesis of Computer Systems (context) - GELENBE, MITRANI - 1980
31   The formulation and analysis of numerical methods for invers.. (context) - FRIEDLAND, NOCEDAL et al. - 1987
31   Convex Analysis and Minimization Algorithms (context) - HIRIART-URRUTY, LEMARECHAL - 1993
31   Gain scheduling: Potential hazards and possible remedies (context) - SHAMMA, ATHANS - 1992
31   Systems: with Applications in Analysis and Statistics (context) - KARLIN, STUDDEN - 1966
31   A semidefinite framework for trust region subproblems with a.. - RENDL, WOLKOWICZ - 1997  ACM
30   Strong duality for semidefinite programming - RAMANA, TUNCEL et al. - 1997  ACM
30   Positive definite completions of partial Hermitian matrices (context) - GRONE, JOHNSON et al. - 1984
30   Indefinite trust region subproblems and nonsymmetric eigenva.. - STERN, WOLKOWICZ - 1995
30   A new reformulation-linearization technique for bilinear pro.. (context) - SHERALI, ALAMEDDINE - 1992
30   Semi-definite matrix constraints in optimization (context) - FLETCHER - 1985
30   Local convergence of predictor-corrector infeasibleinterior .. - KOJIMA, SHIDA et al. - 1996
30   The sandwich theorem - KNUTH - 1994  ACM
29   An exact duality theory for semidefinite programming and its.. - RAMANA - 1997  ACM
29   A family of trust-region based algorithms for unconstrained .. (context) - SHULTZ, SCHNABEL et al. - 1985
28   Second derivatives for optimizing eigenvalues of symmetric m.. (context) - OVERTON, WOMERSLEY - 1995  ACM
28   A trust region strategy for nonlinear equality constrained o.. (context) - CELIS, Jr et al. - 1984
28   Improved approximation algorithms for MAX SAT - ASANO, WILLIAMSON - 2000  ACM   DBLP
28   First and second order analysis of nonlinear semidefinite pr.. - SHAPIRO - 1997  ACM
28   A geometric approach to betweenness - CHOR, SUDAN - 1995  ACM   DBLP
28   How good is the Goemans-Williamson MAX CUT algorithm (context) - KARLOFF - 1996
28   Incorporating condition measures into the complexity theory .. - RENEGAR - 1995
28   Dual quadratic estimates in polynomial and Boolean programmi.. (context) - SHOR - 1990
28   How good is the Goemans-Williamson MAX CUT algorithm (context) - KARLOFF - 1999
27   Stability margins of diagonally perturbed multivariable feed.. (context) - SAFONOV - 1982
27   SP: Software for Semidefinite Programming (context) - VANDENBERGHE, BOYD - 1994
27   Geometric programming: duality in quadratic programming and .. (context) - PETERSON, ECKER - 1969
27   Geometric programming: duality in quadratic programming and .. (context) - PETERSON, ECKER - 1967
27   Grundlehren der Mathematischen Wissenschaften (context) - KATO, for et al. - 1976
27   Quality of semidefinite relaxation for nonconvex quadratic o.. (context) - NESTEROV - 1997
26   potential reduction algorithm for linear programming (context) - YE - 1991
26   Geometric Functional Analysis and its Applications (context) - HOLMES - 1975
26   On Lagrangian relaxation of quadratic matrix constraints - ANSTREICHER, WOLKOWICZ - 2000  ACM
26   Convex analysis on the Hermitian matrices - LEWIS - 1996
26   A simplified homogeneous and self-dual linear programming al.. (context) - XU, HUNG et al. - 1996
26   A continuous based heuristic for the maximum clique problem (context) - GIBBONS, HEARN et al. - 1996
26   A computational study of graph partitioning - FALKNER, RENDL et al. - 1994  ACM
25   A recipe for semidefinite relaxation (context) - POLJAK, RENDL et al. - 1995

[Article contains additional citations not shown here]

Documents on the same site (http://orion.math.uwaterloo.ca/~hwolkowi/henry/software/readme.html):
Measures For Least Change Secant Methods - Zhao (1992)   (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