Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42) - Image 1

£138.86

Springer Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

Name: Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)
Brand: Springer
Price: 138.86 GBP
Availability: InStock

Computer Science

About as cheap as it gets. The only time it was cheaper was 2 months ago.

£139 today · all-time low £139 (May 2026) · usually the usual

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 50 days · 50 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 50 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £139 (44 days, 88.0%)

Price range: £139 - £148

Price levels: 2 different prices over 50 days

Description

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1441948295
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Publication Date: 02 December 2010
Listed Since: 06 July 2010

Barcode

No barcode data available

Springer Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

About as cheap as it gets. The only time it was cheaper was 2 months ago.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives (MOS-SIAM Series on Optimization)

Design and Analysis of Approximation Algorithms: 62 (Springer Optimization and Its Applications, 62)

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

State of the Art in Global Optimization: Computational Methods and Applications: 7 (Nonconvex Optimization and Its Applications, 7)

Modeling and Optimization: Theory and Applications: MOPTA, Bethlehem, PA, USA, August 2014 Selected Contributions: 147 (Springer Proceedings in Mathematics & Statistics, 147)

Bi-Level Strategies in Semi-Infinite Programming: 71 (Nonconvex Optimization and Its Applications, 71)

Large Scale Optimization: State of the Art

State of the Art in Global Optimization: Computational Methods and Applications: 7 (Nonconvex Optimization and Its Applications, 7)

Springer Nonlinear Programming and Variational Inequality Problems

Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research: 12 (Operations Research/Computer Science Interfaces Series, 12)

Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research: 12 (Operations Research/Computer Science Interfaces Series, 12)

Optimization Theory and Applications (Advanced Lectures in Mathematics)

Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)

Convex Optimization with Computational Errors: 155 (Springer Optimization and Its Applications, 155)

Springer Mathematical Theory of Optimization: 56 - Book

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

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

Nonlinear Programming: Theory and Algorithms

Practical Optimization Methods : With Mathematical Applications

Nonlinear Multiobjective Optimization: 12 (International Series in Operations Research & Management Science, 12)

Numerical Nonsmooth Optimization: State of the Art Algorithms

Numerical Optimization with Computational Errors: 108 (Springer Optimization and Its Applications, 108)

Springer Introductory Lectures on Convex Optimization - 87