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, ...
Read More
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.
Read Less
Add this copy of Evaluation Complexity of Algorithms for Nonconvex to cart. $108.84, new condition, Sold by Books2anywhere rated 5.0 out of 5 stars, ships from Fairford, GLOUCESTERSHIRE, UNITED KINGDOM, published 2022 by MP-SIA SIAM-Society for Industrial and Applied M.
Edition:
2022, Society for Industrial & Applied Mathematics,U.S.
Publisher:
Society for Industrial & Applied Mathematics,U.S.
Published:
8/30/2022 12: 00: 00 AM
Language:
English
Alibris ID:
18382875063
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of Evaluation Complexity of Algorithms for Nonconvex to cart. $115.62, new condition, Sold by GreatBookPricesUK5 rated 5.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2022 by Society for Industrial & Applied Mathematics,U.S..
Edition:
2022, Society for Industrial & Applied Mathematics,U.S.
Publisher:
Society for Industrial & Applied Mathematics,U.S.
Published:
2022
Language:
English
Alibris ID:
18360336960
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. MOS-SIAM Series on Optimization . Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Evaluation Complexity of Algorithms for Nonconvex to cart. $115.64, new condition, Sold by Paperbackshop International rated 1.0 out of 5 stars, ships from Fairford, GLOS, UNITED KINGDOM, published 2022 by MP-SIA SIAM-Society for Industrial and Applied M.
Edition:
2022, Society for Industrial & Applied Mathematics,U.S.
Publisher:
Society for Industrial & Applied Mathematics,U.S.
Published:
8/30/2022 12: 00: 00 AM
Language:
English
Alibris ID:
18383776059
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
PLEASE NOTE, WE DO NOT SHIP TO DENMARK. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Please note we cannot offer an expedited shipping service from the UK.
Add this copy of Evaluation Complexity of Algorithms for Nonconvex to cart. $147.85, new condition, Sold by Booksplease rated 4.0 out of 5 stars, ships from Southport, MERSEYSIDE, UNITED KINGDOM, published 2022 by Society for Industrial & Applied Mathematics,U.S..
Edition:
2022, Society for Industrial & Applied Mathematics,U.S.
Add this copy of Evaluation Complexity of Algorithms for Nonconvex to cart. $164.84, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2022 by Society for Industrial & Applied Mathematics,U.S..
Edition:
2022, Society for Industrial & Applied Mathematics,U.S.
Publisher:
Society for Industrial & Applied Mathematics,U.S.
Published:
2022
Language:
English
Alibris ID:
18361756367
Shipping Options:
Standard Shipping: $4.94
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. MOS-SIAM Series on Optimization . Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
