NOTES PERTAINING TO PUBLICATION, DISTRIBUTION, ETC.
Text of Note
Print
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references (p. [465]-484) and index.
CONTENTS NOTE
Text of Note
General introduction -- [Part I. Unconstrained problems.] Basic methods -- Line-searches -- Newtonian methods -- Conjugate gradient -- Special methods -- A case study: seismic reflection tomography -- [Part II. Nonsmooth optimization.] Introduction to nonsmooth optimization -- Some methods in nonsmooth optimization -- Bundle methods. The quest for descent -- Applications of nonsmooth optimization -- Computational exercises -- [Part III. Newton's methods in constrained optimization.] Background -- Local methods for problems with equality constraints -- Local methods for problems with equality and inequality constraints -- Exact penalization -- Globalization by line-search -- Quasi-Newton versions -- [Part IV. Interior-point algorithms for linear and quadratic optimization.] Linearly constrained optimization and simplex algorithm -- Linear monotone complementarity and associated vector fields -- Predictor-corrector algorithms -- Non-feasible algorithms -- Self-duality -- One-step methods -- Complexity of linear optimization problems with integer data -- Karmarkar's algorithm.