國立高雄大學圖資館 |

Language: English

Back

The projected subgradient algorithm ...

SpringerLink (Online service)

The projected subgradient algorithm in convex optimization

Record Type:	Electronic resources : Monograph/item
Title/Author:	The projected subgradient algorithm in convex optimizationby Alexander J. Zaslavski.
Author:	Zaslavski, Alexander J.
Published:	Cham :Springer International Publishing :2020.
Description:	vi, 146 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Mathematical optimization.
Online resource:	https://doi.org/10.1007/978-3-030-60300-7
ISBN:	9783030603007$q(electronic bk.)

The projected subgradient algorithm in convex optimization
Zaslavski, Alexander J.

The projected subgradient algorithm in convex optimization[electronic resource] /by Alexander J. Zaslavski. - Cham :Springer International Publishing :2020. - vi, 146 p. :ill., digital ;24 cm. - 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$q(electronic bk.)

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

183292
Mathematical optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.6

The projected subgradient algorithm in convex optimization
LDR:02812nmm a2200337 a 4500 001 589659
003 DE-He213
005 20210309144244.0
006 m d
007 cr nn 008maaau
008 210601s2020 sz s 0 eng d
020 $a 9783030603007$q(electronic bk.)
020 $a 9783030602994$q(paper)
024 7 $a 10.1007/978-3-030-60300-7 $2 doi
035 $a 978-3-030-60300-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
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
090 $a QA402.5 $b .Z38 2020
100 1 $a Zaslavski, Alexander J. $3 261260
245 1 4 $a The projected subgradient algorithm in convex optimization $h [electronic resource] / $c by Alexander J. Zaslavski.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a vi, 146 p. : $b ill., digital ; $c 24 cm.
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 0 $a Mathematical optimization. $3 183292
650 0 $a Subgradient methods. $3 881631
650 0 $a Hilbert space. $3 184635
650 0 $a Numerical analysis. $3 182073
650 1 4 $a Optimization. $3 274084
650 2 4 $a Numerical Analysis. $3 275681
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in optimization. $3 558249
856 4 0 $u https://doi.org/10.1007/978-3-030-60300-7
950 $a Mathematics and Statistics (SpringerNature-11649)