Tracked shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada The Projected Subgradient Algorithm in Convex Optimization
Type
Physical Book
Author
Publisher
Language
English
Pages
146
Format
Paperback
Dimensions
23.4 x 15.6 x 0.8 cm
Weight
0.23 kg.
ISBN13
9783030602994
Categories

The Projected Subgradient Algorithm in Convex Optimization

Alexander J. Zaslavski (Author) · Springer · Paperback

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

Cheaper New Book Imported to Taiwan
Delivery: 20 Aug - 03 Sep Shipping: 12 to 16 business days.
NT$ 1,880
Faster New Book Imported to Taiwan
Delivery: 10 Aug - 18 Aug Shipping: 4 to 5 business days.
NT$ 2,382
NT$ 1,880

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "The Projected Subgradient Algorithm in Convex Optimization"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews