4.0%OFF
Download App
| >> | LShop | >> | Book | >> | Mathematics & Scienc... | >> | Mathematics | >> | Approximation And Co... |
4.0%OFF
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications (closed))
-
ISBN
:
9780792362753
-
Publisher
:
Springer
-
Subject
:
Mathematics, Education, Computing & Information Technology
-
Binding
:
HARDCOVER
-
Pages
:
594
-
Year
:
2000
₹
29854.0
4.0% OFF
₹
28659.0
28659.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View Details(Imported Edition) Estimated Shipping Time : 25-28 Business Days
View Details
-
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 geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new approximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization problems, new approximate algorithms have been developed based on semidefinite programming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numerical 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. The two themes of approximation and complexity pervade this book. Audience: Faculty, graduate students, and researchers in mathematical programming, computer sciences and engineering.
Related Items
-
of
-
OFFER
Production Systems Engineering: Cost and Performance Optimization
Richard Gustavson
Starts At
8103.0
10663.0
24% OFF
-
OFFER
Machines That Walk: The Adaptive Suspension Vehicle
Shin-Min Song
Starts At
4401.0
5118.0
14% OFF
-
OFFER
The Use of Symbolic Methods in Control System Analysis and Design (I E E Control Engineering Series)
Neil Munro
Starts At
5490.0
6384.0
14% OFF
-
OFFER
Effective Resource Management in Manufacturing Systems: Optimization Algorithms for Production Planning (Springer Series in Advanced Manufacturing)
Massimiliano Caramia
Starts At
18014.0
18765.0
4% OFF
-
OFFER
Design for Manufacturing and Assembly - Concepts, architectures and implementation
O. Molloy
Starts At
18014.0
18765.0
4% OFF
-
OFFER
Mechatronics and manufacturing engineering: Research and development (Woodhead Publishing reviews: Mechanical Engineering)
J. Paulo Davim
Starts At
17973.0
20899.0
14% OFF
-
OFFER
Numerical Modelling in Damage Mechanics (Innovative Technology Series)
Khemais Saanouni
Starts At
6807.0
8957.0
24% OFF
-
OFFER
Numerical Methods for Non-Newtonian Fluids, Volume 16: Special Volume (Handbook of Numerical Analysis)
R. Glowinski
Starts At
12353.0
14364.0
14% OFF
-
OFFER
Optimization Techniques: Approaches and Expositions
Pawan Kumar Oberoi
Starts At
1140.0
1500.0
24% OFF
-
OFFER
Linear Models for Optimal Test Design (Statistics for Social and Behavioral Sciences)
Wim J. van der Linden
Starts At
13920.0
14500.0
4% OFF
-
OFFER
Duality for Nonconvex Approximation and Optimization (CMS Books in Mathematics)
Ivan Singer
Starts At
13101.0
13647.0
4% OFF
-
OFFER
Multiscale Optimization Methods and Applications (Nonconvex Optimization and Its Applications (closed))
William W. Hager
Starts At
13920.0
14500.0
4% OFF
