Interior Point Polynomial Algorithms in Convex Programming: Series Number 13 (Studies in Applied and Numerical Mathematics, Series Number 13) - Image 1

£96.00

Cambridge University Press Interior Point Polynomial Algorithms in Convex Programming: Series Number 13 (Studies in Applied and Numerical Mathematics, Series Number 13)

Name: Interior Point Polynomial Algorithms in Convex Programming: Series Number 13 (Studies in Applied and Numerical Mathematics, Series Number 13)
Brand: Cambridge University Press
Price: 96.0 GBP
Availability: InStock

Algorithms

It has never been this cheap. We have no record of a lower price.

£96 today · cheaper than every other day in the last 3 months

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 58 days • 58 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 58 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £97 (39 days, 67.2%)

Price range: £96 - £97

Price levels: 2 different prices over 58 days

Description

Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.

Product Specifications

Brand: Cambridge University Press
Format: paperback
ASIN: 0898715156
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 01 January 1987
Listed Since: 12 December 2006

Barcode

No barcode data available

Cambridge University Press Interior Point Polynomial Algorithms in Convex Programming: Series Number 13 (Studies in Applied and Numerical Mathematics, Series Number 13)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Semidefinite Optimization and Convex Algebraic Geometry: 13 (MPS-SIAM Series on Optimization, Series Number 13)

Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization: v. 40 (Applied Optimization)

Geometric Methods and Optimization Problems: 4 (Combinatorial Optimization, 4)

Advances in Nonlinear Programming: Proceedings of the 96 International Conference on Nonlinear Programming: 14 (Applied Optimization, 14)

Separable Programming: Theory and Methods: 53 (Applied Optimization, 53)

Approximation and Optimization of Discrete and Differential Inclusions

Mathematical Programs with Equilibrium Constraints

Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications: 65 (Applied Optimization, 65)

Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities: 23 (Springer Optimization and Its Applications, 23)

Nonsmooth Optimization: Analysis And Algorithms With Applications To Optimal Control

Adaptive Dynamic Programming for Control: Algorithms and Stability (Communications and Control Engineering)

Convex Analysis for Optimization: A Unified Approach (Graduate Texts in Operations Research)

Non-Convex Multi-Objective Optimization: 123 (Springer Optimization and Its Applications, 123)

Rigorous Global Search: Continuous Problems: 13 (Nonconvex Optimization and Its Applications, 13)

Algorithmic Principles of Mathematical Programming: 24 (Texts in the Mathematical Sciences, 24)

Duality for Nonconvex Approximation and Optimization (CMS Books in Mathematics)

Conjugate Gradient Algorithms in Nonconvex Optimization: 89 (Nonconvex Optimization and Its Applications, 89)

Nonlinear Conjugate Gradient Methods for Unconstrained Optimization: 158 (Springer Optimization and Its Applications, 158)

Nondifferentiable and Two-Level Mathematical Programming

Theory of Control Systems Described by Differential Inclusions (Springer Tracts in Mechanical Engineering)

Convex Analysis and Global Optimization: 110 (Springer Optimization and Its Applications, 110)

Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications: 60 (Nonconvex Optimization and Its Applications, 60)

Nonconvex Optimal Control and Variational Problems: 82 (Springer Optimization and Its Applications, 82)

Nonlinear Least Squares for Inverse Problems: Theoretical Foundations and Step-by-Step Guide for Applications (Scientific Computation)