Related Research Articles
Mathematical logic, also called formal logic, is a subfield of mathematics exploring the formal applications of logic to mathematics. It bears close connections to metamathematics, the foundations of mathematics, philosophy, and theoretical computer science. The unifying themes in mathematical logic include the study of the expressive power of formal systems and the deductive power of formal proof systems.
Mathematical optimization or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. Optimization problems of sorts arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
Dynamic programming is both a mathematical optimization method and a computer programming method. The method was developed by Richard Bellman in the 1950s and has found applications in numerous fields, from aerospace engineering to economics.
The calculus of variations is a field of mathematical analysis that uses variations, which are small changes in functions and functionals, to find maxima and minima of functionals: mappings from a set of functions to the real numbers. Functionals are often expressed as definite integrals involving functions and their derivatives. Functions that maximize or minimize functionals may be found using the Euler–Lagrange equation of the calculus of variations.
Ernst Friedrich Ferdinand Zermelo was a German logician and mathematician, whose work has major implications for the foundations of mathematics. He is known for his role in developing Zermelo–Fraenkel axiomatic set theory and his proof of the well-ordering theorem.
Optimal control theory is a branch of mathematical optimization that deals with finding a control for a dynamical system over a period of time such that an objective function is optimized. It has numerous applications in science, engineering and operations research. For example, the dynamical system might be a spacecraft with controls corresponding to rocket thrusters, and the objective might be to reach the moon with minimum fuel expenditure. Or the dynamical system could be a nation's economy, with the objective to minimize unemployment; the controls in this case could be fiscal and monetary policy. A dynamical system may also be introduced to embed operations research problems within the framework of optimal control theory.
Richard Ernest Bellman was an American applied mathematician, who introduced dynamic programming in 1953, and made important contributions in other fields of mathematics.
In optimal control theory, the Hamilton–Jacobi–Bellman (HJB) equation gives a necessary and sufficient condition for optimality of a control with respect to a loss function. It is, in general, a nonlinear partial differential equation in the value function, which means its solution is the value function itself. Once this solution is known, it can be used to obtain the optimal control by taking the maximizer of the Hamiltonian involved in the HJB equation.
Pontryagin's maximum principle is used in optimal control theory to find the best possible control for taking a dynamical system from one state to another, especially in the presence of constraints for the state or input controls. It states that it is necessary for any optimal control along with the optimal state trajectory to solve the so-called Hamiltonian system, which is a two-point boundary value problem, plus a maximum condition of the control Hamiltonian. These necessary conditions become sufficient under certain convexity conditions on the objective and constraint functions.
Harold Calvin Marston Morse was an American mathematician best known for his work on the calculus of variations in the large, a subject where he introduced the technique of differential topology now known as Morse theory. The Morse–Palais lemma, one of the key results in Morse theory, is named after him, as is the Thue–Morse sequence, an infinite binary sequence with many applications. In 1933 he was awarded the Bôcher Memorial Prize for his work in mathematical analysis.
A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the "value" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into a sequence of simpler subproblems, as Bellman's “principle of optimality” prescribes.
In mathematics, Hilbert's fourth problem in the 1900 Hilbert problems is a foundational question in geometry. In one statement derived from the original, it was to find — up to an isomorphism — all geometries that have an axiomatic system of the classical geometry, with those axioms of congruence that involve the concept of the angle dropped, and `triangle inequality', regarded as an axiom, added.
Hilbert's twenty-second problem is the penultimate entry in the celebrated list of 23 Hilbert problems compiled in 1900 by David Hilbert. It entails the uniformization of analytic relations by means of automorphic functions.
Hilbert's fifteenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by David Hilbert. The problem is to put Schubert's enumerative calculus on a rigorous foundation.
Hilbert's nineteenth problem is one of the 23 Hilbert problems, set out in a list compiled in 1900 by David Hilbert. It asks whether the solutions of regular problems in the calculus of variations are always analytic. Informally, and perhaps less directly, since Hilbert's concept of a "regular variational problem" identifies precisely a variational problem whose Euler–Lagrange equation is an elliptic partial differential equation with analytic coefficients, Hilbert's nineteenth problem, despite its seemingly technical statement, simply asks whether, in this class of partial differential equations, any solution function inherits the relatively simple and well understood structure from the solved equation. Hilbert's nineteenth problem was solved independently in the late 1950s by Ennio De Giorgi and John Forbes Nash, Jr.
Hilbert's twentieth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by David Hilbert. It asks whether all boundary value problems can be solved.
Gilbert Ames Bliss,, was an American mathematician, known for his work on the calculus of variations.
A native of Terre Haute, Indiana, Stuart E. Dreyfus is Professor Emeritus at University of California, Berkeley in the Industrial Engineering and Operations Research Department. While at the Rand Corporation he was a programmer of the JOHNNIAC computer. While at Rand he coauthored Applied Dynamic Programming with Richard Bellman. Following that work, he was encouraged to pursue a Ph.D. which he completed in applied mathematics at Harvard University in 1964, on the calculus of variations. In 1962, Dreyfus simplified the Dynamic Programming-based derivation of backpropagation using only the chain rule. He also coauthored Mind Over Machine with his brother Hubert Dreyfus in 1986.
Moshe Zakai was a Distinguished Professor at the Technion, Israel in Electrical Engineering, member of the Israel Academy of Sciences and Humanities and Rothschild Prize winner.
References
- ↑ Hilbert, David, "Mathematische Probleme" Göttinger Nachrichten, (1900), pp. 253-297, and in Archiv der Mathematik und Physik, (3) 1 (1901), 44-63 and 213-237. Published in English translation by Dr. Maby Winton Newson, Bulletin of the American Mathematical Society 8 (1902), 437-479 doi : 10.1090/S0002-9904-1902-00923-3 . [A fuller title of the journal Göttinger Nachrichten is Nachrichten von der Königl. Gesellschaft der Wiss. zu Göttingen.]
- ↑ van Brunt, Bruce (2004). The Calculus of Variations. Springer. ISBN 0-387-40247-0.
- 1 2 Ferguson, James (2004). "Brief Survey of the History of the Calculus of Variations and its Applications". arXiv: math/0402357 .CS1 maint: discouraged parameter (link)
- ↑ Dimitri P Bertsekas. Dynamic programming and optimal control. Athena Scientific, 2005.
- ↑ Bellman, Richard E. (1954). "Dynamic Programming and a new formalism in the calculus of variations". Proc. Natl. Acad. Sci. 40 (4): 231–235. Bibcode:1954PNAS...40..231B. doi:10.1073/pnas.40.4.231. PMC 527981 . PMID 16589462.
- ↑ Kushner, Harold J. (2004). "Richard E. Bellman Control Heritage Award". American Automatic Control Council. Retrieved 2013-07-28.CS1 maint: discouraged parameter (link) See 2004: Harold J. Kushner: regarding Dynamic Programming, "The calculus of variations had related ideas (e.g., the work of Caratheodory, the Hamilton-Jacobi equation). This led to conflicts with the calculus of variations community."