Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Society For Industrial & Applied Mathematics,U.S., 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: Revaluation Books, Exeter, Regno Unito
EUR 101,42
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 529 pages. 10.24x7.32x1.54 inches. In Stock.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 107,36
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 108,09
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics,U.S., US, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 126,14
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: New. 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 bookon 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.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: Majestic Books, Hounslow, Regno Unito
EUR 119,52
Quantità: 3 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics, 1987
ISBN 10: 0898714605 ISBN 13: 9780898714609
Da: YourTechBooks, Bala Cynwyd, PA, U.S.A.
Hardcover. Condizione: Very Good. Used, like-new, tight spine, no markings, from smoke-free environment.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics,U.S., US, 2022
ISBN 10: 1611976987 ISBN 13: 9781611976984
Da: Rarewaves.com UK, London, Regno Unito
EUR 118,84
Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: New. 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 bookon 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.
Lingua: Inglese
Editore: Society for Industrial & Applied, 2000
ISBN 10: 0898714605 ISBN 13: 9780898714609
Da: Revaluation Books, Exeter, Regno Unito
EUR 188,52
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 959 pages. 10.00x7.00x2.00 inches. In Stock.