Nonlinear Optimization (1999)

Cached

Download Links

by C. Roos , T. Terlaky
Citations:6 - 1 self

Documents Related by Co-Citation

8 Convexity and optimization in dimensions I – Witzgall - 1970
3279 Convex Analysis – R. Tyrrell Rockafellar - 1970
254 Interior Point Polynomial Methods in Convex Programming – Y Nesterov, A Nemirovskii - 1994
13 Geometric programming – E L Peterson - 1976
34 Primal-dual interior point approach to semidefinite programming – J F Sturm - 1997
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
8 Self-regular proximities and new search directions for linear and semidefinite optimization – Jiming Peng, Cornelis Roos, Tamás Terlaky - 2000
136 A Mathematical View of Interior-point Methods – James Renegar - 2001
4 Geometric programming and some applications – E Klafszky - 1974
2 Communication at the – J Brinkhuis - 2000
7 On the classical logarithmic barrier method for a class of smooth convex programming problems – D den Hertog, C Roos, T Terlaky - 1992
14 The Method of Analytic Centers for Smooth Convex Programs – F Jarre - 1989
47 The logarithmic potential method of convex programming – K R Frisch - 1955
312 Nonlinear programming: sequential unconstrained minimization techniques,” DTIC Research Report AD0679036 – A V Fiacco, G P McCormick - 1968
5 A quadratically convergent polynomial interior-point algorithm for solving entropy optimization problems – F Potra, Y Ye - 1993
8 On ℓ p programming”, European – T Terlaky
86 Theory and Algorithms for Linear Optimization. An InteriorPoint Approach – Vial - 1997
62 Convexity and Optimization in Finite Dimensions – J Stoer, C Witzgall - 1970
2 A conic formulation for lp-norm optimization, IMAGE – Glineur, T Terlaky - 2000