All Books Sale Books Course Books Events & News Stores Sale Books Sale Books Course Books Course Books Course Books Events & News Events & News Events & News Stores
twitter
All Books
on our tables
new releases
best sellers
Browse the Labyrinth...
African American Studies
African Studies
Anthropology & Archaeology
Architecture
Art
Asian Studies
Biography
Children's Books
Christianity
Classical Studies
Cognitive Sciences
Cultural Studies
Current Events
Design & Fashion
Eastern European Studies
Eastern Religion & Philosophy
Economics
Education
Environmental Studies
European History & Politics
Film & Media
Food & Cooking
Foreign Language
Gay & Lesbian Studies
General History & Historiography
Home, Garden & Crafts
Islamic Studies
Jewish Studies
Labor Studies
Latin Am. & Caribbean Studies
Law & Legal Studies
Linguistics & Languages
Literary Theory & Criticism
Literature
Marxist Studies
Medical & Health Studies
Middle Eastern Studies
Music & Dance
Mythology
Native American Studies
Natural History & Nature
No export
Philosophy
Photography
Political Philosophy
Political Science
Psychoanalysis
Psychology
Reference
Religion
S. Asian Studies & Oceania
Sciences
Sociology
Stationery
Technology, Computers & Engineering
Trade Fiction
Trade Non-fiction
Travel
U.S. History & Politics
Urban Studies & Geography
Women's Studies
Title Details
Self-Regularity by Peng, Jiming, et al.
Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms
by Peng, Jiming, et al.
 
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.

 
Published 20021007 by Princeton, Hardcover, 208 Pages, ISBN: 9780691091921, ISBN-10: 0691091927, List Price $105.00.

Buy New - $56.98 (save $48.02)
 Add to Wish List

Other books by Peng, Jiming, et al.
Other books in Mathematics
Other books in Computers
 
 
Inventory Snapshot
Warehouse --> New for $56.98
All Books Sale Books Course Books Events & News Stores All Books Sale Books Course Books All Books All Books Course Books Course Books help policies contact
All Books on our tables new releases
best sellers