國立虎尾科技大學 |

Convex Optimization with Computational Errors

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Convex Optimization with Computational Errors/ by Alexander J. Zaslavski.
作者:	Zaslavski, Alexander J.
面頁冊數:	XI, 360 p. 150 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Computational Mathematics and Numerical Analysis. -
電子資源:	https://doi.org/10.1007/978-3-030-37822-6
ISBN:	9783030378226

Convex Optimization with Computational Errors
Zaslavski, Alexander J.

Convex Optimization with Computational Errors[electronic resource] /by Alexander J. Zaslavski. - 1st ed. 2020. - XI, 360 p. 150 illus.online resource. - Springer Optimization and Its Applications,1551931-6828 ;. - Springer Optimization and Its Applications,104.

Preface -- 1. Introduction -- 2. Subgradient Projection Algorithm -- 3. The Mirror Descent Algorithm -- 4. Gradient Algorithm with a Smooth Objective Function -- 5. An Extension of the Gradient Algorithm -- 6. Continuous Subgradient Method -- 7. An optimization problems with a composite objective function -- 8. A zero-sum game with two-players -- 9. PDA-based method for convex optimization -- 10 Minimization of quasiconvex functions.-11. Minimization of sharp weakly convex functions.-12. A Projected Subgradient Method for Nonsmooth Problems -- References. -Index. .

This book studies 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 well known as important tools for solving optimization problems. The research presented continues from the author's (c) 2016 book Numerical Optimization with Computational Errors. Both books study algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to obtain the approximate solution and the number of iterations needed. The discussion takes into consideration that for every algorithm, its iteration consists of several steps; computational errors for various steps are generally different. This fact, which was not accounted for in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps—a calculation of a subgradient of the objective function and a calculation of a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are generally different. The book is of interest for researchers and engineers working in optimization. It also can be useful in preparation courses for graduate students. The main feature of the book will appeal specifically to researchers and engineers working in optimization as well as to experts in applications of optimization to engineering and economics.

ISBN: 9783030378226

Standard No.: 10.1007/978-3-030-37822-6doiSubjects--Topical Terms:

669338
Computational Mathematics and Numerical Analysis.

LC Class. No.: QA315-316

Dewey Class. No.: 515.64

Convex Optimization with Computational Errors
LDR:03569nam a22004335i 4500 001 1019401
003 DE-He213
005 20200707021435.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030378226 $9 978-3-030-37822-6
024 7 $a 10.1007/978-3-030-37822-6 $2 doi
035 $a 978-3-030-37822-6
050 4 $a QA315-316
050 4 $a QA402.3
072 7 $a PBKQ $2 bicssc
072 7 $a MAT005000 $2 bisacsh
072 7 $a PBKQ $2 thema
072 7 $a PBU $2 thema
082 0 4 $a 515.64 $2 23
100 1 $a Zaslavski, Alexander J. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1022503
245 1 0 $a Convex Optimization with Computational Errors $h [electronic resource] / $c by Alexander J. Zaslavski.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XI, 360 p. 150 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 155
505 0 $a Preface -- 1. Introduction -- 2. Subgradient Projection Algorithm -- 3. The Mirror Descent Algorithm -- 4. Gradient Algorithm with a Smooth Objective Function -- 5. An Extension of the Gradient Algorithm -- 6. Continuous Subgradient Method -- 7. An optimization problems with a composite objective function -- 8. A zero-sum game with two-players -- 9. PDA-based method for convex optimization -- 10 Minimization of quasiconvex functions.-11. Minimization of sharp weakly convex functions.-12. A Projected Subgradient Method for Nonsmooth Problems -- References. -Index. .
520 $a This book studies 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 well known as important tools for solving optimization problems. The research presented continues from the author's (c) 2016 book Numerical Optimization with Computational Errors. Both books study algorithms taking into account computational errors which are always present in practice. The main goal is, for a known computational error, to obtain the approximate solution and the number of iterations needed. The discussion takes into consideration that for every algorithm, its iteration consists of several steps; computational errors for various steps are generally different. This fact, which was not accounted for in the previous book, is indeed important in practice. For example, the subgradient projection algorithm consists of two steps—a calculation of a subgradient of the objective function and a calculation of a projection on the feasible set. In each of these two steps there is a computational error and these two computational errors are generally different. The book is of interest for researchers and engineers working in optimization. It also can be useful in preparation courses for graduate students. The main feature of the book will appeal specifically to researchers and engineers working in optimization as well as to experts in applications of optimization to engineering and economics.
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 669338
650 1 4 $a Calculus of Variations and Optimal Control; Optimization. $3 593942
650 0 $a Computer mathematics. $3 1199796
650 0 $a Calculus of variations. $3 527927
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030378219
776 0 8 $i Printed edition: $z 9783030378233
776 0 8 $i Printed edition: $z 9783030378240
830 0 $a Springer Optimization and Its Applications, $x 1931-6828 ; $v 104 $3 1255232
856 4 0 $u https://doi.org/10.1007/978-3-030-37822-6
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)