numerical optimization computational errors de zaslavski alexander (14 résultats)

Etat : Sehr gut. Zustand: Sehr gut | Seiten: 316 | Sprache: Englisch | Produktart: Sonstiges.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book studies the approximate solutions of optimization problems inthe presence of computational errors. A number of results are presented on theconvergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative. This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton's method.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book studies the approximate solutions of optimization problems inthe presence of computational errors. A number of results are presented on theconvergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative. This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton's method.

Taschenbuch. Etat : Neu. Neuware -This book studies the approximate solutions of optimization problems in the presence of computational errors. A number of results are presented on the convergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative.This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton¿s method.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch.

Buch. Etat : Neu. Neuware -This book studies the approximate solutions of optimization problems in the presence of computational errors. A number of results are presented on the convergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative.This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton¿s method.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 316 pp. Englisch.

Paperback. Etat : New. New. book.

Paperback. Etat : Brand New. reprint edition. 316 pages. 9.25x6.10x0.72 inches. In Stock.

Etat : New. pp. 304.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Examines&nbspapproximate solutions of optimization problems in&nbspthe presence of computational errorsReinforces basic principles with an&nbspintroductory&nbspchapterAnalyzes the gradient projection algorithm for minimization of co.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Examines&nbspapproximate solutions of optimization problems in&nbspthe presence of computational errorsReinforces basic principles with an&nbspintroductory&nbspchapterAnalyzes the gradient projection algorithm for minimization of co.

Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book studies the approximate solutions of optimization problems inthe presence of computational errors. A number of results are presented on theconvergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative. This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton's method. 316 pp. Englisch.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book studies the approximate solutions of optimization problems inthe presence of computational errors. A number of results are presented on theconvergence behavior of algorithms in a Hilbert space; these algorithms are examined taking into account computational errors. The author illustrates that algorithms generate a good approximate solution, if computational errors are bounded from above by a small positive constant. Known computational errors are examined with the aim of determining an approximate solution. Researchers and students interested in the optimization theory and its applications will find this book instructive and informative. This monograph contains 16 chapters; including a chapters devoted to the subgradient projection algorithm, the mirror descent algorithm, gradient projection algorithm, the Weiszfelds method, constrained convex minimization problems, the convergence of a proximal point method in a Hilbert space, the continuous subgradient method, penalty methods and Newton's method. 316 pp. Englisch.

Etat : New. Print on Demand pp. 304.

Etat : New. PRINT ON DEMAND pp. 304.