Skip to product information
1 of 1

Evaluation Complexity of Algorithms for Nonconvex Optimization

Evaluation Complexity of Algorithms for Nonconvex Optimization

Theory, Computation, and Perspectives

Hardback

Regular price £104.99
Regular price Sale price £104.99

Join our rewards scheme and earn reward points on this purchase!

Earn points on this!

Sign in or Sign up!
View full details
  • Release Date: 30/08/2022
  • Barcode: 9781611976984
Evaluation Complexity of Algorithms for Nonconvex Optimization

Evaluation Complexity of Algorithms for Nonconvex Optimization

Collapsible content

DESCRIPTION

Theory, Computation, and Perspectives
The first book on complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems, and to address the disadvantages of traditional optimality measures and propose useful surrogates.
One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable assumptions—and given access to problem-function values and derivatives of various degrees—how many evaluations might be required to approximately solve the problem?

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first book

  • on complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,
  • to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and
  • to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.
This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.

DELIVERY & RETURNS

UK Delivery:

  • Free delivery on all orders of £10 or more.
  • £1.49 delivery fee on orders below £10.
  • UK orders are shipped via Royal Mail 2nd Class.

International Delivery:

  • Flat rate delivery charges vary by country.

Dispatch and Delivery Times:

  • All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
  • UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
  • International estimated delivery times:
  • Europe & Channel Islands: 7 to 10 working days
  • USA: 7 to 15 working days
  • Rest of the World: 9 to 21 working days

View our full delivery infomation here.

  • OVER

    2 MILLION PRODUCTS

  • 60 MILLION CUSTOMERS

    ACROSS 190 COUNTRIES