國立虎尾科技大學 |

The Projected Subgradient Algorithm in Convex Optimization

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	The Projected Subgradient Algorithm in Convex Optimization/ by Alexander J. Zaslavski.
作者:	Zaslavski, Alexander J.
面頁冊數:	VI, 146 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Numerical Analysis. -
電子資源:	https://doi.org/10.1007/978-3-030-60300-7
ISBN:	9783030603007

The Projected Subgradient Algorithm in Convex Optimization
Zaslavski, Alexander J.

The Projected Subgradient Algorithm in Convex Optimization[electronic resource] /by Alexander J. Zaslavski. - 1st ed. 2020. - VI, 146 p.online resource. - SpringerBriefs in Optimization,2190-8354. - SpringerBriefs in Optimization,.

1. Introduction -- 2. Nonsmooth Convex Optimization -- 3. Extensions -- 4. Zero-sum Games with Two Players -- 5. Quasiconvex Optimization -- References.

This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts in applications of optimization to engineering and economics. The goal is to obtain a good approximate solution of the problem in the presence of computational errors. The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for diﬀerent steps are diﬀerent, in general. The book is especially useful for the reader because it contains solutions to a number of difficult and interesting problems in the numerical optimization. The subgradient projection algorithm is one of the most important tools in optimization theory and its applications. An optimization problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first step requires a calculation of a subgradient of the objective function; the second requires a calculation of a projection on the feasible set. The computational errors in each of these two steps are different. This book shows that the algorithm discussed, generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if computational errors for the two steps of the algorithm are known, one discovers an approximate solution and how many iterations one needs for this. In addition to their mathematical interest, the generalizations considered in this book have a significant practical meaning.

ISBN: 9783030603007

Standard No.: 10.1007/978-3-030-60300-7doiSubjects--Topical Terms:

671433
Numerical Analysis.

LC Class. No.: QA402.5-402.6

Dewey Class. No.: 519.6

The Projected Subgradient Algorithm in Convex Optimization
LDR:03129nam a22003975i 4500 001 1029611
003 DE-He213
005 20201125142925.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030603007 $9 978-3-030-60300-7
024 7 $a 10.1007/978-3-030-60300-7 $2 doi
035 $a 978-3-030-60300-7
050 4 $a QA402.5-402.6
072 7 $a PBU $2 bicssc
072 7 $a MAT003000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
100 1 $a Zaslavski, Alexander J. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1022503
245 1 4 $a The Projected Subgradient Algorithm in Convex Optimization $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 VI, 146 p. $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 SpringerBriefs in Optimization, $x 2190-8354
505 0 $a 1. Introduction -- 2. Nonsmooth Convex Optimization -- 3. Extensions -- 4. Zero-sum Games with Two Players -- 5. Quasiconvex Optimization -- References.
520 $a This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts in applications of optimization to engineering and economics. The goal is to obtain a good approximate solution of the problem in the presence of computational errors. The discussion takes into consideration the fact that for every algorithm its iteration consists of several steps and that computational errors for diﬀerent steps are diﬀerent, in general. The book is especially useful for the reader because it contains solutions to a number of difficult and interesting problems in the numerical optimization. The subgradient projection algorithm is one of the most important tools in optimization theory and its applications. An optimization problem is described by an objective function and a set of feasible points. For this algorithm each iteration consists of two steps. The first step requires a calculation of a subgradient of the objective function; the second requires a calculation of a projection on the feasible set. The computational errors in each of these two steps are different. This book shows that the algorithm discussed, generates a good approximate solution, if all the computational errors are bounded from above by a small positive constant. Moreover, if computational errors for the two steps of the algorithm are known, one discovers an approximate solution and how many iterations one needs for this. In addition to their mathematical interest, the generalizations considered in this book have a significant practical meaning.
650 2 4 $a Numerical Analysis. $3 671433
650 1 4 $a Optimization. $3 669174
650 0 $a Numerical analysis. $3 527939
650 0 $a Mathematical optimization. $3 527675
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030602994
776 0 8 $i Printed edition: $z 9783030603014
830 0 $a SpringerBriefs in Optimization, $x 2190-8354 $3 1254063
856 4 0 $u https://doi.org/10.1007/978-3-030-60300-7
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)