Wyniki wyszukiwania:

The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems.The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems. A number of algorithms are...

Nonconvex Optimal Control and Variational Problems is an important contribution to the existing literature in the field and is devoted to the presentation of progress made in the last 15 years of research in the area of optimal control and the calculus of variations. This volume contains a number of results concerning well-posedness of optimal control and variational problems, nonoccurrence of the Lavrentiev phenomenon for optimal control and variational problems, and turnpike properties of approximate solutions of variational problems.

Chapter 1 contains an introduction as...

Individual turnpike results are of great interest due to their numerous applications in engineering and in economic theory; in this book the study is focused on new results of turnpike phenomenon in linear optimal control problems. The book is intended for engineers as well as for mathematicians interested in the calculus of variations, optimal control and in applied functional analysis.

Two large classes of problems are studied in more depth. The first class studied in Chapter 2 consists of linear control problems with periodic nonsmooth convex integrands. Chapters 3-5 consist of...

This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take...

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...

This book is devoted to the study of the turnpike phenomenon and describes the existence of solutions for a large variety of infinite horizon optimal control classes of problems. Chapter 1 provides introductory material on turnpike properties. Chapter 2 studies the turnpike phenomenon for discrete-time optimal control problems. The turnpike properties of autonomous problems with extended-value integrands are studied in Chapter 3. Chapter 4 focuses on large classes of infinite horizon optimal control problems without convexity (concavity) assumptions. In Chapter 5, the turnpike results for...