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

£165.17

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: 165.12 GBP
Availability: InStock

Computer Science

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 81 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £165 (75 days, 92.6%)

Price range: £165 - £170

Price levels: 2 different prices over 81 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: Hardcover
ASIN: 0792362756
Category: Books > Subjects > Computing & Internet > Computer Science
Domain: Amazon UK
Release Date: 31 May 2000
Listed Since: 15 February 2007

Barcode

No barcode data available

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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Optimization and Applications: 12th International Conference, OPTIMA 2021, Petrovac, Montenegro, September 27 – October 1, 2021, Proceedings: 13078 (Lecture Notes in Computer Science, 13078)

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

Nonlinear Combinatorial Optimization: 147 (Springer Optimization and Its Applications, 147)

High Performance Optimization: 33 (Applied Optimization, 33)

Linear and Nonlinear Optimization: 253 (International Series in Operations Research & Management Science, 253)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Proceedings of International Conference on Scientific and Natural Computing: Proceedings of SNC 2021 (Algorithms for Intelligent Systems)

NEO 2016: Results of the Numerical and Evolutionary Optimization Workshop NEO 2016 and the NEO Cities 2016 Workshop held on September 20-24, 2016 in ... (Studies in Computational Intelligence, 731)

Computational and Analytical Mathematics: In Honor of Jonathan Borwein's 60th Birthday: 50 (Springer Proceedings in Mathematics & Statistics, 50)

Computational and Analytical Mathematics: In Honor of Jonathan Borwein's 60th Birthday: 50 (Springer Proceedings in Mathematics & Statistics, 50)

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

Advances in Global Optimization: 95 (Springer Proceedings in Mathematics & Statistics, 95)

Metaheuristics: Progress in Complex Systems Optimization: 39 (Operations Research/Computer Science Interfaces Series, 39)

Computer Science and Operations Research: New Developments in their Interfaces

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

Optimization Theory and Methods: Nonlinear Programming: 1 (Springer Optimization and Its Applications, 1)

Optimization Theory and Methods: Nonlinear Programming: 1 (Springer Optimization and Its Applications, 1)

Approximation and Optimization: Algorithms, Complexity and Applications: 145 (Springer Optimization and Its Applications, 145)

Fixed-Point Algorithms for Inverse Problems in Science and Engineering: 49 (Springer Optimization and Its Applications, 49)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Deterministic Global Optimization: An Introduction to the Diagonal Approach (SpringerBriefs in Optimization)

Foundations of Network Optimization and Games: 3 (Complex Networks and Dynamic Systems, 3)

Elements of the General Theory of Optimal Algorithms: 188 (Springer Optimization and Its Applications, 188)

The Basics of Practical Optimization