Self–Regularity – A New Paradigm for Primal–Dual Interior–Point Algorithms (Princeton Series in Applied Mathematics) - Image 1

£53.60

Princeton University Press Self–Regularity – A New Paradigm for Primal–Dual Interior–Point Algorithms (Princeton Series in Applied Mathematics)

Name: Self-Regularity - A New Paradigm for Primal-Dual Interior-Point Algorithms (Princeton Series in Applied Mathematics)
Brand: Princeton University Press
Price: 53.6 GBP
Availability: InStock

Professionals & Academics

This is the usual price. Wait for it to drop, or tell us your number.

£54 today · usual range £0–£0 · best ever £42

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 637 days • 637 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 637 days • 7 price levels

Days at Price

Current Price

Price Analysis

Most common price: £51 (221 days, 34.7%)

Price range: £42 - £54

Price levels: 7 different prices over 637 days

Description

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.

Product Specifications

Brand: Princeton University Press
Format: Hardcover
ASIN: 0691091927
Category: Books > Subjects > Biography > Professionals & Academics
Domain: Amazon UK
Release Date: 06 December 2002
Listed Since: 16 December 2006

Barcode

No barcode data available

Princeton University Press Self–Regularity – A New Paradigm for Primal–Dual Interior–Point Algorithms (Princeton Series in Applied Mathematics)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Springer Introductory Lectures on Convex Optimization - 87

Optimization: Algorithms and Consistent Approximations: 124 (Applied Mathematical Sciences, 124)

Nonlinear Optimization in Finite Dimensions: Morse Theory, Chebyshev Approximation, Transversality, Flows, Parametric Aspects: 47 (Nonconvex Optimization and Its Applications, 47)

Nonlinear Programming: Theory and Algorithms

Nonlinear Optimization in Finite Dimensions: Morse Theory, Chebyshev Approximation, Transversality, Flows, Parametric Aspects: 47 (Nonconvex Optimization and Its Applications, 47)

Convex Analysis and Global Optimization: 22 (Nonconvex Optimization and Its Applications, 22)

Variational Analysis and Generalized Differentiation in Optimization and Control: In Honor of Boris S. Mordukhovich: 47 (Springer Optimization and Its Applications, 47)

Modern Numerical Nonlinear Optimization: 195 (Springer Optimization and Its Applications, 195)

Optimization Theory and Applications (Advanced Lectures in Mathematics)

High Performance Optimization: 33 (Applied Optimization, 33)

Linear and Nonlinear Programming: 228 (International Series in Operations Research & Management Science, 228)

Numerical Nonsmooth Optimization: State of the Art Algorithms

Finite-Dimensional Variational Inequalities and Complementarity Problems (Springer Series in Operations Research and Financial Engineering)

Finite-Dimensional Variational Inequalities and Complementarity Problems (Springer Series in Operations Research and Financial Engineering)

Practical Methods of Optimization 2e

Foundations of Bilevel Programming: 61 (Nonconvex Optimization and Its Applications, 61)

Optimization: Algorithms and Applications

Optimization for Machine Learning (Neural Information Processing series)

Smooth Nonlinear Optimization in Rn: 19 (Nonconvex Optimization and Its Applications, 19)

Basic Concepts of Global Optimization: 5 (Mathematics Study Resources, 5)

Introduction to the Theory of Nonlinear Optimization

Handbook of Global Optimization: 2 (Nonconvex Optimization and Its Applications, 2)

Introduction to Global Optimization: 3 (Nonconvex Optimization and Its Applications, 3)

Introduction to Optimization and Semidifferential Calculus: 12 (MPS-SIAM Series on Optimization, Series Number 12)