Introduction

Alexander Zaslavski
Additional contact information
Alexander Zaslavski: Israel Institute of Technology

Chapter Chapter 1 in Convex Optimization with Computational Errors, 2020, pp 1-24 from Springer

Abstract: Abstract In this book we study the behavior of algorithms for constrained convex minimization problems in a Hilbert space. Our goal is to obtain a good approximate solution of the problem in the presence of computational errors. It is known that the algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a small constant. In our study, presented in this book, we take 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. In this chapter we discuss several algorithms which are studied in this book.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-37822-6_1

Ordering information: This item can be ordered from
http://www.springer.com/9783030378226

DOI: 10.1007/978-3-030-37822-6_1

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().