The calculus of variations, whose origins can be traced to the works of Aristotle and Zenodoros, is now Ii vast repository supplying fundamental tools of exploration not only to the mathematician, but-as evidenced by current literature-also to those in most branches of science in which mathematics is applied. (Indeed, the macroscopic statements afforded by variational principles may provide the only valid mathematical formulation of many physical laws. ) As such, it retains the spirit of natural philosophy common to most mathematical investigations prior to this century. How ever, it is a discipline in which a single symbol (b) has at times been assigned almost mystical powers of operation and discernment, not readily subsumed into the formal structures of modern mathematics. And it is a field for which it is generally supposed that most questions motivating interest in the subject will probably not be answerable at the introductory level of their formulation. In earlier articles,1,2 it was shown through several examples that a complete characterization of the solution of optimization problems may be available by elementary methods, and it is the purpose of this work to explore further the convexity which underlay these individual successes in the context of a full introductory treatment of the theory of the variational calculus. The required convexity is that determined through Gateaux variations, which can be defined in any real linear space and which provide an unambiguous foundation for the theory.

An introduction to the variational methods used to formulate and solve mathematical and physical problems, allowing the reader an insight into the systematic use of elementary (partial) convexity of differentiable functions in Euclidian space. By helping students directly characterize the solutions for many minimization problems, the text serves as a prelude to the field theory for sufficiency, laying as it does the groundwork for further explorations in mathematics, physics, mechanical and electrical engineering, as well as computer science.

This clear and concise textbook provides a rigorous introduction to the calculus of variations, depending on functions of one variable and their first derivatives. It is based on a translation of a German edition of the book Variationsrechnung (Vieweg+Teubner Verlag, 2010), translated and updated by the author himself. Topics include: the Euler-Lagrange equation for one-dimensional variational problems, with and without constraints, as well as an introduction to the direct methods. The book targets students who have a solid background in calculus and linear algebra, not necessarily in functional analysis. Some advanced mathematical tools, possibly not familiar to the reader, are given along with proofs in the appendix. Numerous figures, advanced problems and proofs, examples, and exercises with solutions accompany the book, making it suitable for self-study. The book will be particularly useful for beginning graduate students from the physical, engineering, and mathematical sciences with a rigorous theoretical background.

From its origins in the minimization of integral functionals, the notion of variations has evolved greatly in connection with applications in optimization, equilibrium, and control. This book develops a unified framework and provides a detailed exposition of variational geometry and subdifferential calculus in their current forms beyond classical and convex analysis. Also covered are set-convergence, set-valued mappings, epi-convergence, duality, and normal integrands.

This textbook offers a concise yet rigorous introduction to calculus of variations and optimal control theory, and is a self-contained resource for graduate students in engineering, applied mathematics, and related subjects. Designed specifically for a one-semester course, the book begins with calculus of variations, preparing the ground for optimal control. It then gives a complete proof of the maximum principle and covers key topics such as the Hamilton-Jacobi-Bellman theory of dynamic programming and linear-quadratic optimal control. Calculus of Variations and Optimal Control Theory also traces the historical development of the subject and features numerous exercises, notes and references at the end of each chapter, and suggestions for further study. Offers a concise yet rigorous introduction Requires limited background in control theory or advanced mathematics Provides a complete proof of the maximum principle Uses consistent notation in the exposition of classical and modern topics Traces the historical development of the subject Solutions manual (available only to teachers) Leading universities that have adopted this book include: University of Illinois at Urbana-Champaign ECE 553: Optimum Control Systems Georgia Institute of Technology ECE 6553: Optimal Control and Optimization University of Pennsylvania ESE 680: Optimal Control Theory University of Notre Dame EE 60565: Optimal Control

Thorough introduction to an important area of mathematics Contains recent results Includes many exercises

Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.