Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The book is devoted to the study of approximate solutions of optimization problems in the presence of computational errors. It contains a number of results on the convergence behavior of algorithms in a Hilbert space, which are known as important tools for solving optimization problems. The research presented in the book is the continuation and the further development of the author's (c) 2016 book Numerical Optimization with Computational Errors, Springer 2016. Both books study the algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to find out what an approximate solution can be obtained and how many iterates one needs for this.The main difference between this new book and the 2016 book is that in this present book the discussion takes into consideration the fact that for every algorithm, its iteration consists of several steps and that computational errors for different steps are generally, different. This fact, which was not taken into account in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are different in general.It may happen that the feasible set is simple and the objective function is complicated. As a result, the computational error, made when one calculates the projection, is essentially smaller than the computational error of the calculation of the subgradient. Clearly, an opposite case is possible too.Another feature of this book is a study of a number of important algorithms which appeared recently in the literature and which are not discussed in the previous book.This monograph contains 12 chapters. Chapter 1 is an introduction. In Chapter 2 we study the subgradient projection algorithm for minimization of convex and nonsmooth functions. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 3 we analyze the mirror descent algorithm for minimization of convex and nonsmooth functions, under the presence of computational errors. For this algorithm each iteration consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we solve an auxiliary minimization problem on the set of feasible points. In each of these two steps there is a computational error. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 4 we analyze the projected gradient algorithm with a smooth objective function under the presence of computational errors. In Chapter 5 we consider an algorithm, which is an extension of the projection gradient algorithm used for solving linear inverse problems arising in signal/image processing. In Chapter 6 we study continuous subgradient method and continuous subgradient projection algorithm for minimization of convex nonsmooth functions and for computing the saddle points of convex-concave functions, under the presence of computational errors. All the results of this chapter has no prototype in [NOCE]. In Chapters 7-12 we analyze several algorithms under the presence of computational errors which were not considered in [NOCE]. Again, each step of an iteration has a computational errors and we take into account that these errors are, in general, different. An optimization problems with a composite objective function is studied in Chapter 7. A zero-sum game with two-players is considered in Chapter 8. A predicted decrease approximation-based method is used in Chapter 9 for constrained convex optimization. Chapter 10 is devoted tomin 372 pp. Englisch. Seller Inventory # 9783030378240

Contact seller

Buy New

US$ 108.88

Convert currency

Shipping: US$ 25.25

From Germany to U.S.A.

Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Convex Optimization with Computational Errors

Alexander J. Zaslavski

Published by Springer International Publishing, Springer International Publishing, 2021

ISBN 10: 3030378241 ISBN 13: 9783030378240

New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The book is devoted to the study of approximate solutions of optimization problems in the presence of computational errors. It contains a number of results on the convergence behavior of algorithms in a Hilbert space, which are known as important tools for solving optimization problems. The research presented in the book is the continuation and the further development of the author's (c) 2016 book Numerical Optimization with Computational Errors, Springer 2016. Both books study the algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to find out what an approximate solution can be obtained and how many iterates one needs for this.The main difference between this new book and the 2016 book is that in this present book the discussion takes into consideration the fact that for every algorithm, its iteration consists of several steps and that computational errors for different steps are generally, different. This fact, which was not taken into account in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we calculate a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are different in general.It may happen that the feasible set is simple and the objective function is complicated. As a result, the computational error, made when one calculates the projection, is essentially smaller than the computational error of the calculation of the subgradient. Clearly, an opposite case is possible too.Another feature of this book is a study of a number of important algorithms which appeared recently in the literature and which are not discussed in the previous book.This monograph contains 12 chapters. Chapter 1 is an introduction. In Chapter 2 we study the subgradient projection algorithm for minimization of convex and nonsmooth functions. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 3 we analyze the mirror descent algorithm for minimization of convex and nonsmooth functions, under the presence of computational errors. For this algorithm each iteration consists of two steps. The first step is a calculation of a subgradient of the objective function while in the second one we solve an auxiliary minimization problem on the set of feasible points. In each of these two steps there is a computational error. We generalize the results of [NOCE] and establish results which has no prototype in [NOCE]. In Chapter 4 we analyze the projected gradient algorithm with a smooth objective function under the presence of computational errors. In Chapter 5 we consider an algorithm, which is an extension of the projection gradient algorithm used for solving linear inverse problems arising in signal/image processing. In Chapter 6 we study continuous subgradient method and continuous subgradient projection algorithm for minimization of convex nonsmooth functions and for computing the saddle points of convex-concave functions, under the presence of computational errors. All the results of this chapter has no prototype in [NOCE]. In Chapters 7-12 we analyze several algorithms under the presence of computational errors which were not considered in [NOCE]. Again, each step of an iteration has a computational errors and we take into account that these errors are, in general, different. An optimization problems with a composite objective function is studied in Chapter 7. A zero-sum game with two-players is considered in Chapter 8. A predicted decrease approximation-based method is used in Chapter 9 for constrained convex optimization. Chapter 10 is devoted tomin. Seller Inventory # 9783030378240

Contact seller

Buy New

US$ 108.88

Convert currency

Shipping: US$ 33.82

From Germany to U.S.A.

Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Convex Optimization with Computational Errors (Springer Optimization and Its Applications)

Zaslavski, Alexander J.

Published by Springer, 2021

ISBN 10: 3030378241 ISBN 13: 9783030378240

New Paperback

Seller: Mispah books, Redhill, SURRE, United Kingdom

Seller rating 4 out of 5 stars

Paperback. Condition: New. New. book. Seller Inventory # ERICA77330303782416

Contact seller

Buy New

US$ 113.27

Convert currency

Shipping: US$ 31.97

From United Kingdom to U.S.A.

Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Convex Optimization with Computational Errors (Springer Optimization and Its Applications) 1st ed. 2020 Edition

Zaslavski, Alexander J.

Published by Springer, 2021

ISBN 10: 3030378241 ISBN 13: 9783030378240

New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars

Condition: New. Seller Inventory # 26384600649

Contact seller

Buy New

US$ 143.35

Convert currency

Shipping: US$ 3.99

Within U.S.A.

Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Convex Optimization with Computational Errors

Alexander J. Zaslavski

Published by Springer International Publishing, 2021

ISBN 10: 3030378241 ISBN 13: 9783030378240

New Kartoniert / Broschiert

Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars

Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Studies the influence of computational errors in numerical optimization,&nbspfor minimization&nbspproblems on unbounded sets, and&nbsptime zero-sum&nbspgames with two players Explains that for every algorithm its iteration. Seller Inventory # 448680767

Contact seller