65

Method of centers for minimizing generalized eigenvalues
– Stephen Boyd, Laurent El Ghaoui
 1993

774

Semidefinite Programming
– Lieven Vandenberghe, Stephen Boyd
 1996

16

An interior point method for generalized linearfractional programming
– E Nesterov, A S Nemirovsky
 1991

46

sdpsol: A Parser/Solver for Semidefinite Programs with Matrix Structure
– Shaopo Wu, Stephen Boyd
 1995

482

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
– Farid Alizadeh
 1993

652

A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
– N. Karmarkar
 1984

34

An “analytical centre” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
– G Sonnevend
 1985

254

Interior Point Polynomial Methods in Convex Programming
– Y Nesterov, A Nemirovskii
 1994

36

SP: Software for Semidefinite Programming. User’s Guide
– L Vandenberghe, S Boyd

87

A PrimalDual Potential Reduction Method for Problems Involving Matrix Inequalities
– Lieven Vandenberghe, Stephen Boyd
 1995

8

A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints
– A KAMATH, N KARMARKAR
 1992

17

A.: A general approach to polynomialtime algorithm design for convex programming
– Y Nesterov, Nemirovski
 1988

47

An interiorpoint method for minimizing the maximum eigenvalue of a linear combination of matrices
– F Jarre
 1993

14

A nonlinear programming problem in statistics (educational testing
– R Fletcher
 1981

45

Geometric Algorithms and
– M Grötschel, L Lovász, A Schrijver
 1993

17

The projective method for solving linear matrix inequalities
– P Gahinet, A Nemirovski

29

SelfScaled Cones and InteriorPoint Methods in Nonlinear Programming
– Yu.E. Nesterov, M.J. Todd
 1994

150

Lower bounds for the partitioning of graphs
– W E Donath, A J Hoffman
 1973

312

Nonlinear programming: sequential unconstrained minimization techniques,” DTIC Research Report AD0679036
– A V Fiacco, G P McCormick
 1968
