Nonlinear Optimization (CO 367)

[1]  Richard W. Cottle,et al.  Two characterizations of sufficient matrices , 1992 .

[2]  F. Jarre.  Interior-point methods for convex programming , 1992 .

[3]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[4]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[5]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[6]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[7]  R. Cottle,et al.  Sufficient matrices and the linear complementarity problem , 1989 .

[8]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[9]  Florian Jarre,et al.  A sufficient condition for self-concordance, with application to some classes of structured convex programming problems , 1995, Math. Program..

[10]  Joseph G. Ecker,et al.  Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs) , 1969 .

[11]  T. Terlaky,et al.  The linear complimentarity problem, sufficient matrices, and the criss-cross method , 1993 .

[12]  H. Markowitz.  Portfolio Selection: Efficient Diversification of Investments , 1971 .

[13]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[14]  F. Jarre.  Interior-point methods via self-concordance or relative lipschitz condition , 1995 .

[15]  Florian Jarre,et al.  Interior-Point Methods for Classes of Convex Programs , 1996 .

[16]  K. Kortanek,et al.  A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier , 1992 .

[17]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[18]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[19]  Kurt M. Anstreicher,et al.  A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm , 1990, Math. Program..

[20]  T. Terlaky.  On lp programming , 1985 .

[21]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[22]  J. Stoer,et al.  Convexity and Optimization in Finite Dimensions I , 1970 .

[23]  Philip E. Gill,et al.  Numerical Linear Algebra and Optimization , 1991 .

[24]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[25]  Clarence Zener,et al.  Geometric Programming , 1974 .

[26]  J. Ecker,et al.  Geometric programming: Duality in quadratic programming and lp-approximation III (degenerate programs) , 1970 .

[27]  Panos M. Pardalos,et al.  Introduction to Global Optimization , 2000, Introduction to Global Optimization.

[28]  E. Klafszky,et al.  On the duality of the mixed entropy programming , 1993 .

[29]  H. Markowitz.  The optimization of a quadratic function subject to linear constraints , 1956 .

[30]  T. Terlaky,et al.  Some generalizations of the criss-cross method for quadratic programming , 1992 .

[31]  Jean-Philippe Vial,et al.  Theory and algorithms for linear optimization - an interior point approach , 1998, Wiley-Interscience series in discrete mathematics and optimization.