Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms

Jiming Peng

ISBN 10: 0691091935 / ISBN 13: 9780691091938

Editore: Princeton University Press, 2002

Riguardo questo articolo

Presents a framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function. This book deals with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. Series: Princeton Series in Applied Mathematics. Num Pages: 208 pages, 1, black & white illustrations. BIC Classification: PBU; PBW. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 229 x 152 x 11. Weight in Grams: 28. . 2002. Paperback. . . . .

Codice articolo V9780691091938

Dati bibliografici

• Titolo: Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms
• Editore: Princeton University Press
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 0691091935
• ISBN 13: 9780691091938
• Rilegatura: Brossura
• Condizione: New

Descrizione articolo

Riassunto

Research on interior-point methods (IPMs) has dominated the field of mathematical programming for the last two decades. Two contrasting approaches in the analysis and implementation of IPMs are the so-called small-update and large-update methods, although, until now, there has been a notorious gap between the theory and practical performance of these two strategies. This book comes close to bridging that gap, presenting a new framework for the theory of primal-dual IPMs based on the notion of the self-regularity of a function.

The authors deal with linear optimization, nonlinear complementarity problems, semidefinite optimization, and second-order conic optimization problems. The framework also covers large classes of linear complementarity problems and convex optimization. The algorithm considered can be interpreted as a path-following method or a potential reduction method. Starting from a primal-dual strictly feasible point, the algorithm chooses a search direction defined by some Newton-type system derived from the self-regular proximity. The iterate is then updated, with the iterates staying in a certain neighborhood of the central path until an approximate solution to the problem is found. By extensively exploring some intriguing properties of self-regular functions, the authors establish that the complexity of large-update IPMs can come arbitrarily close to the best known iteration bounds of IPMs.

Researchers and postgraduate students in all areas of linear and nonlinear optimization will find this book an important and invaluable aid to their work.

Informazioni sull?autore

Jiming Peng is Professor of Mathematics at McMaster University and has published widely on nonlinear programming and interior-points methods. Cornelis Roos holds joint professorships at Delft University of Technology and Leiden University. He is an editor of several journals, coauthor of more than 100 papers, and coauthor (with Tamás Terlaky and Jean-Philippe Vial) of Theory and Algorithms for Linear Optimization. Tamás Terlaky is Professor in the Department of Computing and Software at McMaster University, founding Editor in Chief of Optimization and Engineering, coauthor of more than 100 papers, and an editor of several journals and two books.