๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Algorithms for constrained minimization of smooth nonlinear functions

โœ Scribed by A.G. Buckley, J-.L. Goffin


Publisher
North-Holland
Year
1982
Tongue
English
Leaves
197
Series
Mathematical programming study 16
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The watchdog technique for forcing convergence in algorithms for constrained optimization / R.M. Chamberlain ... [et al.] -- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization / D. Gabay -- A superlinearly convergent algorithm for constrained optimization problems / D.Q. Mayne and E. Polak -- Computation of the search direction in constrained optimization algorithms / W. Murray and M.H. Wright -- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints / B.A. Murtagh and M.A. Saunders -- On some experiments which delimits the utility of nonlinear programming methods for engineering design / E. Sandgren and K.M. Ragsdell -- Determining feasibility of a set of nonlinear inequality constraints / R. Schnabel -- Conjugate gradient methods for linearly constrained nonlinear programming / D.F. Shanno and R.E. Marsten -- Asymptotic properties of reduction methods applying linearly constrained reduced problems / C. van der Hoek


๐Ÿ“œ SIMILAR VOLUMES


Nonlinear Programming: Sequential Uncons
โœ Anthony V. Fiacco, Garth P. McCormick ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

A reprint of the original volume, which won the Lanchester Prize awarded by the Operations Research Society of America for the best work of 1968. Although out of print for nearly 15 years, it remains one of the most referenced volumes in the field of mathematical programming. <P>Recent interest i

Nonlinear Programming: Sequential Uncons
โœ Anthony V. Fiacco, Garth P. McCormick ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

A reprint of the original volume, which won the Lanchester Prize awarded by the Operations Research Society of America for the best work of 1968. Although out of print for nearly 15 years, it remains one of the most referenced volumes in the field of mathematical programming. <P>Recent interest i