Langue: anglais
Edité par SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 107,30
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 113,75
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Langue: anglais
Edité par Society For Industrial & Applied Mathematics,U.S., 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 101,26
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 529 pages. 10.24x7.32x1.54 inches. In Stock.
Langue: anglais
Edité par SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 107,19
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Langue: anglais
Edité par SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 107,96
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Langue: anglais
Edité par Society for Industrial and Applied Mathematics,U.S., US, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
EUR 126,63
Quantité disponible : 1 disponible(s)
Ajouter au panierHardback. Etat : 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.
Langue: anglais
Edité par SIAM-Society for Industrial and Applied Mathematics, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : Majestic Books, Hounslow, Royaume-Uni
EUR 119,98
Quantité disponible : 3 disponible(s)
Ajouter au panierEtat : New.
Langue: anglais
Edité par Society for Industrial and Applied Mathematics, 1987
ISBN 10 : 0898714605 ISBN 13 : 9780898714609
Vendeur : YourTechBooks, Bala Cynwyd, PA, Etats-Unis
EUR 160,82
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Very Good. Used, like-new, tight spine, no markings, from smoke-free environment.
Langue: anglais
Edité par Society for Industrial and Applied Mathematics,U.S., US, 2022
ISBN 10 : 1611976987 ISBN 13 : 9781611976984
Vendeur : Rarewaves.com UK, London, Royaume-Uni
EUR 118,65
Quantité disponible : 1 disponible(s)
Ajouter au panierHardback. Etat : 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.
Langue: anglais
Edité par Society for Industrial & Applied, 2000
ISBN 10 : 0898714605 ISBN 13 : 9780898714609
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 188,22
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 959 pages. 10.00x7.00x2.00 inches. In Stock.