Geometric Approach to Pontryagin's Maximum Principle

Since the second half of the 20th century, Pontryagin's Maximum Principle has been widely discussed and used as a method to solve optimal control problems in medicine, robotics, finance, engineering, astronomy. Here, we focus on the proof and on the understanding of this Principle, using as much geometric ideas and geometric tools as possible. This approach provides a better and clearer understanding of the Principle and, in particular, of the role of the abnormal extremals. These extremals are interesting because they do not depend on the cost function, but only on the control system. Moreover, they were discarded as solutions until the nineties, when examples of strict abnormal optimal curves were found. In order to give a detailed exposition of the proof, the paper is mostly self\textendash{}contained, which forces us to consider different areas in mathematics such as algebra, analysis, geometry.Comment: Final version. Minors changes have been made. 56 page

A deep cut ellipsoid algorithm for convex programming

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent some of the numerical instabilities and theoretical drawbacks usually associated with the algorithm are also provided. Moreover, for a large class of convex programs a simple proof of its rate of convergence is given and the relation with previously known results is discussed. Finally some computational results of the deep and central cut version of the algorithm applied to a min—max stochastic queue location problem are reported