000			00734nam a2200169Ia 4500
005			20241211205611.0
008			241211s1995 xx 000 0 und d
020			_afcnm133
082			_a519.76I/B45
100			_aBertsekas, Dimitri P.
245		0	_aNonlinear Programming
250			_a1ra
260			_aU.S.A : _bAthena Scientific, _c1995
300			_a646 páginas
505			_a1.Unconstrained Optimization. 2.Optimization over a Convex Set. 3.Lagrange Multiplier Theory. 4.Lagrange Multiplier Algorithms. 5.Duality and Convex Programming. 6.Dual Methods. 7.Appendix A: Mathematical Background. 8.Appendix B: Convex Analysis. 9.Appendix C: Line Search Methods. 10.Appendix D: Implementation of Newton´s Method.
942			_yLIB
999			_c49378 _d49378