|
208
|
Interior point polynomial methods in convex programming
– Y E Nesterov, A Nemirovski
- 1994
|
|
8
|
Convexity and optimization in dimensions I
– Witzgall
- 1970
|
|
31
|
Primal-dual interior point approach to semidefinite programming
– J Sturm
- 1997
|
|
2333
|
Convex Analysis
– r t rockafellar
- 1970
|
|
8
|
On ℓ p programming”, European
– T Terlaky
|
|
12
|
Geometric programming: duality in quadratic programming and lp-approximation. III. Degenerate programs
– E L PETERSON, J G ECKER
- 1970
|
|
4
|
Geometric programming and some applications
– E Klafszky
- 1974
|
|
2
|
A conic formulation for lp-norm optimization, IMAGE
– Glineur, T Terlaky
- 2000
|
|
11
|
Geometric Programming
– R J Dun, E L Peterson, C Zener
- 1967
|
|
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 p-norms, Working
– G Xue, Y Ye
- 1997
|
|
4
|
Theory of linear programming, Linear Equalities and Related Systems
– A J Goldman, A W Tucker
- 1956
|
|
93
|
H.: Applications of second-order cone programming. Linear Algebra Appl
– M S Lobo, L Vandenberghe, S Boyd, Lebret
- 1998
|
|
2
|
Nonlinear optimization, Notes from a lecture given at
– Y Nesterov
- 1996
|
|
3
|
Conic formulation for lp-norm optimization
– F Glineur, T Terlaky
|
|
76
|
Theory and Algorithms for Linear Optimization: An Interior Point Approach
– Vial
|
