The Projected Subgradient Algorithm in Convex Optimization

The Projected Subgradient Algorithm in Convex Optimization
Author :
Publisher : Springer Nature
Total Pages : 148
Release :
ISBN-10 : 9783030603007
ISBN-13 : 3030603008
Rating : 4/5 (07 Downloads)

Book Synopsis The Projected Subgradient Algorithm in Convex Optimization by : Alexander J. Zaslavski

Download or read book The Projected Subgradient Algorithm in Convex Optimization written by Alexander J. Zaslavski and published by Springer Nature. This book was released on 2020-11-25 with total page 148 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 different steps are different, 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.


The Projected Subgradient Algorithm in Convex Optimization Related Books

The Projected Subgradient Algorithm in Convex Optimization
Language: en
Pages: 148
Authors: Alexander J. Zaslavski
Categories: Mathematics
Type: BOOK - Published: 2020-11-25 - Publisher: Springer Nature

DOWNLOAD EBOOK

This focused monograph presents a study of subgradient algorithms for constrained minimization problems in a Hilbert space. The book is of interest for experts
Convex Optimization
Language: en
Pages: 142
Authors: Sébastien Bubeck
Categories: Convex domains
Type: BOOK - Published: 2015-11-12 - Publisher: Foundations and Trends (R) in Machine Learning

DOWNLOAD EBOOK

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. It begins with the fundamental theory of black-b
Fundamentals of Convex Analysis
Language: en
Pages: 268
Authors: Jean-Baptiste Hiriart-Urruty
Categories: Mathematics
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

This book is an abridged version of the two volumes "Convex Analysis and Minimization Algorithms I and II" (Grundlehren der mathematischen Wissenschaften Vol. 3
Convex Optimization
Language: en
Pages: 744
Authors: Stephen P. Boyd
Categories: Business & Economics
Type: BOOK - Published: 2004-03-08 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how
First-Order Methods in Optimization
Language: en
Pages: 476
Authors: Amir Beck
Categories: Mathematics
Type: BOOK - Published: 2017-10-02 - Publisher: SIAM

DOWNLOAD EBOOK

The primary goal of this book is to provide a self-contained, comprehensive study of the main ?rst-order methods that are frequently used in solving large-scale