000			01112nam a2200169Ia 4500
005			20241211205637.0
008			241211s1976 xx 000 0 und d
020			_afcnm1744
082			_a519.76I/A92
100			_aAvriel, Mordecai.
245		0	_aNonlinear Programming Analysis and Methods
250			_a1ra
260			_aNew York : _bDover Publications, _c1976
300			_a512 páginas
505			_a1.Introduction. 2.Classical optimization unconstrained and equality constrained problems. 3.Optimality conditions for constrained extrema. 4.Convex sets and functions. 5.Duality in nonlinear convex programming. 6.Generalized convexity. 7.Analysis of selected nonlinear programming problems. 8.One- dimensional optimization. 9.Multidimensional unconstrained optimization without derivatives: empirical and conjugate direction methods. 10.Second derivate, steepest descent and conjugate gradient methods. 11.Variable metric algorithmic. 12.Penalty function methods. 13.Solution of constrained problems by extensions of unconstrained optimization techniques. 14.Approximation-type algorithms.
942			_yLIB
999			_c50965 _d50965