你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Self-Regularity: A new Paradigm for Primal-Dual Interior-Point Algorithms
Type
Physical Book
Publisher
Author
Year
2002
Language
English
Pages
208
Format
Paperback
ISBN
0691091935
ISBN13
9780691091938
Categories

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

Jiming Peng; Cornelis Roos; TamÁS Terlaky (Author) · Princeton University Press · Paperback

Self-Regularity: A new Paradigm for Primal-Dual Interior-Point Algorithms - Jiming Peng; Cornelis Roos; TamÁS Terlaky

Cheaper New Book Imported to Taiwan
Delivery: 13 Nov - 26 Nov Shipping: 12 to 16 business days.
NT$ 3,368
Faster New Book Imported to Taiwan
Delivery: 16 Nov - 24 Nov Shipping: 13 to 14 business days.
NT$ 4,952
NT$ 3,368

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Self-Regularity: A new Paradigm for Primal-Dual Interior-Point Algorithms "

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews