254

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

8

Convexity and optimization in dimensions I
– Witzgall
 1970

34

Primaldual interior point approach to semidefinite programming
– J F Sturm
 1997

3279

Convex Analysis
– R. Tyrrell Rockafellar
 1970

8

On ℓ p programming”, European
– T Terlaky

12

Geometric Programming: Duality in Quadratic Programming and lp Approximation III
– E L Peterson, J G Ecker
 1970

4

Geometric programming and some applications
– E Klafszky
 1974

2

A conic formulation for lpnorm optimization, IMAGE
– Glineur, T Terlaky
 2000

13

Geometric programming
– E L Peterson
 1976

6

Nonlinear Optimization
– C. Roos, T. Terlaky
 1999

3

Duality results, High Performance Optimization
– J F Sturm
 1999

1

Geometric programming, Seminar Notes, no. 11.976, Hungarian Committee for Systems Analysis
– E Klafszky
 1976

7

A sucient condition for selfconcordance with application to some classes of structured convex programming problems
– D den Hertog, F Jarre, C Roos, T Terlaky
 1995

1

An ecient algorithm for minimizing a sum of pnorms, Working
– G Xue, Y Ye
 1997

5

Theory of linear programming,” in Linear Equalities and Related
– A J Goldman, A W Tucker
 1956

115

H.: Applications of secondorder cone programming. Linear Algebra and its Applications 284
– M Lobo, L Vandenberghe, S Boyd, Lebret
 1998

2

Nonlinear optimization, Notes from a lecture given at
– Y Nesterov
 1996

86

Theory and Algorithms for Linear Optimization. An InteriorPoint Approach
– Vial
 1997

134

Theory of linear and integer programming. WileyInterscience series in discrete mathematics and optimization
– A Schrijver
 1999
