Interior point methods of mathematical programming /

Interior point methods of mathematical programming /

Saved in:

Bibliographic Details
Imprint:	Dordrecht, Netherlands ; Boston : Kluwer, ©1996.
Description:	xxi, 528 pages : illustrations ; 25 cm.
Language:	English
Series:	Applied optimization ; v. 5 Applied optimization ; v. 5.
Subject:	Interior-point methods. Linear programming. Interior-point methods. Linear programming.
Format:	Print Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11697539

Hidden Bibliographic Details
Other authors / contributors:	Terlaky, Tamás.
ISBN:	0792342011 9780792342014
Notes:	Includes bibliographical references.
Summary:	The book provides an overview of the research in interior point methods since the publication of N. Karmarkar's seminal paper in 1984. Leading international experts have contributed to the book with summaries of their relevant areas of specialization. Part I gives an overview of basic variants of interior point algorithms for linear programming. Duality-theory for LP and sensitivity analysis is developed. Results on the affine scale, path following, potential reduction, infeasible interior point methods and implementation strategies are discussed. Part II deals with nonlinear programming. Here necessary smoothness conditions are introduced and illustrated. Algorithms for general smooth convex problems, complementarity and semidefinite optimization problems are presented. The implementation of barrier methods for general nonlinear optimization problems is also considered. Part III covers some application areas such as combinatorial optimization, global optimization and VLSI design.

Eckhart

Loading map link

Holdings details from Eckhart
Call Number:	QA402.5.I4885 1996
c.1	Available Loan period: standard loan Request for Pickup Need help? - Ask a Librarian