Optimality functions and lopsided convergence
Royset, Johannes O.
Wets, Roger J-B.
MetadataShow full item record
Optimality functions pioneered by E. Polak characterize stationary points, quantify the degree with which a point fails to be stationary, and play central roles in algorithm development. For optimization problems requiring approximations, optimality functions can be used to ensure consistency in approximations, with the consequence that optimal and stationary points of the approximate problems indeed are approximately optimal and stationary for an original problem. In this paper, we review the framework and illustrate its application to nonlinear programming and other areas. Moreover, we introduce lopsided convergence of bifunctions on metric spaces and show that this notion of convergence is instrumental in establishing consistency of approximations. Lopsided convergence also leads to further characterizations of stationary points under perturbations and approximations.
The article of record as published may be found at http://dx.doi.org/10.1007/s10957-015-0839-0
Showing items related by title, author, creator and subject.
Foraker, Joseph Carl. (Monterey, California. Naval Postgraduate School, 2011-09);We show how to formulate many continuous time-and-space search problems as generalized optimal control problems, where multiple searchers look for multiple targets. Speci cally, we formulate problems in which we minimize ...
Gong, Qi; Ross, I. Michael; Fahroo, Fariba (AIAA, 2010-03);Among the various pseudospectral (PS) methods for optimal control , only the Legendre PS method has been mathematically proven to guarantee the feasibility, consistency, and convergence of the approximations [2–5]. As ...
Fahroo, Fahroo; Ross, Michael I. (2008);Solving an optimal control problem using a digital computer implies discrete approximations. Since the 1960s, there have been well-documented [1–3] naïve applications of Pontryagin’s principle in the discrete domain. ...