Bibliography

Ber16

Dimitri P. Bertsekas. Nonlinear Programming. Athena Scientific, third edition, 2016. ISBN 978-1-886529-05-2. URL: http://www.athenasc.com/nonlinbook.html.

BV04

S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004. ISBN 978-0-521-83378-3. URL: https://web.stanford.edu/ boyd/cvxbook/.

CT17

Richard W. Cottle and Mukund N. Thapa. Linear and Nonlinear Optimization. International Series in Operations Research & Management Science. Springer, 2017. ISBN 978-1-4939-7053-7. doi:10.1007/978-1-4939-7055-1.

GNS08

Igor Griva, Stephen G. Nash, and Ariela Sofer. Linear and Nonlinear Optimization. SIAM, second edition, 2008. ISBN 978-0-89871-661-0. URL: https://bookstore.siam.org/OT108/.

Kar84

N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373–395, 1984. doi:10.1007/BF02579150.

LRWW98

Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, and Paul E. Wright. Convergence Properties of the Nelder–Mead Simplex Method in Low Dimensions. SIAM Journal on Optimization, 9(1):112–147, 1998. doi:10.1137/S1052623496303470.

LY16

David G. Luenberger and Yinyu Ye. Linear and Nonlinear Programming. International Series in Operations Research & Management Science. Springer, fourth edition, 2016. ISBN 978-3-319-18841-6. URL: http://www.athenasc.com/nonlinbook.html.

NM65

J. A. Nelder and R. Mead. A Simplex Method for Function Minimization. The Computer Journal, 7(4):308–313, 1965. doi:10.1093/comjnl/7.4.308.

PCB02

C.J. Price, I.D. Coope, and D. Byatt. A Convergent Variant of the Nelder–Mead Algorithm. Journal of Optimization Theory and Applications, 113(1):5–19, 2002. doi:10.1023/A:1014849028575.