Interior point methods of mathematical programming /

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...

Full description

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Terlaky, Tamás (Editor)
Format:	eBook
Language:	English
Published:	Dordrecht ; Boston : Kluwer Academic Publishers, 1996.
Series:	Applied optimization ; 5.
Subjects:	Interior-point methods. Linear programming. Mathematics. Optimization. Operations Research, Management Science. Operations Research/Decision Theory. Electrical engineering. Electronic books.
Online Access:	Connect to the full text of this electronic book

Table of Contents:

I Linear Programming
1 Introduction to the Theory of Interior Point Methods
2 Affine Scaling Algorithm
3 Target-Following Methods for Linear Programming
4 Potential Reduction Algorithms
5 Infeasible-Interior-Point Algorithms
6 Implementation of Interior-Point Methods for Large Scale Linear Programs
II Convex Programming
7 Interior-Point Methods for Classes of Convex Programs
8 Complementarity Problems
9 Semidefinite Programming
10 Implementing Barrier Methods for Nonlinear Programming
III Applications, Extensions
11 Interior point Methods for Combinatorial Optimization
12 Interior Point Methods for Global Optimization
13 Interior Point Approaches for the VLSI Placement Problem.