follow us on twitter and facebook follow us on facebook follow us on Google+ follow us on twitter follow us on LinkedIn
Download DNLeBooks.com toolbar
Self-Regularity
 
 
 
 
Self-Regularity by Jiming Peng
 
USD 65.00
 
Self-Regularity
Jiming Peng
Available on Windows Available on Android
View in Browser
Download Standalone
Preview
Get DNL Reader
To view the Standalone version, you require the installation of the small file size DNL Reader. To get the DNL Reader, click the "Get DNL Reader" button.
To view the Standalone version, you require the installation of the small file size EPP Reader. To get the EPP Reader, click the "Get EPP Reader" button.
To view the eBook you require the installation of the reader from Android Market to get the reader. click the "Get DNL Reader" button.
 
Share this  
 
 
Downloads : 774
File Size : 17.46 M
 
 
Publisher : Princeton University Press
 
Imprint : Princeton University Press
ISBN : 9781400825134
 
 
 
 
  Overview  
 

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.

 
 
Get DNL Reader, itís free.
Create your own eBook
Download ePageWiz
 
Princeton.eBook.com
 
site map  |   home  |   contact  |   contact  |   terms and conditions  |   privacy policy
   
  © 2014  DNAML  DNAML  
Other eBook Stores:  -  dnlebooks.com  -  Enter4books.com  -  Loveebooks.com  -  romance.dnlebooks.com  -  cleverbooks.com  -  ebookauthors.com  -  ebookmafia.com
spacer
spacer