Abstract
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.
Similar content being viewed by others
Notes
We recall that the outer limit of a sequence of sets \(\{A^\nu \}_{\nu \in \mathbb {N}}\), denoted by \(\mathop {{\mathrm{limsup}}}\nolimits A^\nu \), is the collection of points y to which a subsequence of \(\{y^\nu \}_{\nu \in \mathbb {N}}\), with \(y^\nu \in A^\nu \), converges. The inner limit, denoted by \(\mathop {{\mathrm{liminf}}}\nolimits A^\nu \), is the points to which a sequence of \(\{y^\nu \}_{\nu \in \mathbb {N}}\), with \(y^\nu \in A^\nu \), converges. If both limits exist and are identical, we say that the set is the Painlevé–Kuratowski limit of \(\{A^\nu \}_{\nu \in \mathbb {N}}\) and that \(A^\nu \) set-converges to this set; see [18, 20].
Here, we consider set-convergence of subsets of \(\mathcal{X}\times \mathbb {R}\), which is equipped with the metric \(\rho ((x,x_0),(x',x_0'))=\max \{d_\mathcal{X}(x,x'),|x_0-x_0'|\}\) for \(x,x'\in \mathcal{X}\) and \(x_0,x_0'\in \mathbb {R}\).
We note that Theorem 3.1 is stated for finite-valued functions and \(h^\nu \) and h might be extended real-valued. However, the conclusions hold under this slight extension.
References
Polak, E.: Optimization. Algorithms and Consistent Approximations, Applied Mathematical Sciences, vol. 124. Springer, New York (1997)
Royset, J.O.: Optimality functions in stochastic programming. Math. Program. 135(1), 293–321 (2012)
Royset, J.O., Pee, E.Y.: Rate of convergence analysis of discretization and smoothing algorithms for semi-infinite minimax problems. J. Optim. Theory Appl. 155(3), 855–882 (2012)
Foraker, J.C., Royset, J.O., Kaminer, I.: Search-trajectory optimization: part 1, formulation and theory. J. Optim. Theory Appl. (2015)
Phelps, C., Royset, J.O., Gong, Q.: Optimal control of uncertain systems using sample average approximations. SIAM J. Control Optim. (2015)
Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299–332 (1997)
Zangwill, W.I.: Nonlinear Programming: A Unified Approach. Prentice-Hall, Englewood Cliffs (1969)
Royset, J.O., Szechtman, R.: Optimal budget allocation for sample average approximation. Oper. Res. 61, 762–776 (2013)
Royset, J.O.: On sample size control in sample average approximations for solving smooth stochastic programs. Comput. Optim. Appl. 55(2), 265–309 (2013)
Pasupathy, R.: On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58(4), 889–901 (2010)
Polak, E.: On the use of models in the synthesis of optimization algorithms. In: Kuhn, H., Szego, G. (eds.) Differential Games and Related Topics, pp. 263–279. North Holland, Amsterdam (1971)
Polak, E.: Computational Methods in Optimization. A Unified Approach. Academic Press, New York (1971)
Attouch, H., Wets, R.: Convergence des points min/sup et de points fixes. C. R. Acad. Sci. Paris 296, 657–660 (1983)
Jofre, A., Wets, R.: Variational convergence of bivariate functions: lopsided convergence. Math. Program. B 116, 275–295 (2009)
Jofre, A., Wets, R.: Variational convergence of bifunctions: motivating applications. SIAM J. Optim. 24(4), 1952–1979 (2014)
Attouch, H.: Variational Convergence for Functions and Operators. Applicable Mathematics Sciences. Pitman, Boston (1984)
Aubin, J.P., Frankowska, H.: Set-Valued Analysis. Birkhäuser, Boston (1990)
Rockafellar, R.T., Wets, R.: Variational Analysis. Grundlehren der Mathematischen Wissenschaft, vol. 317, 3rd printing-2009 edn. Springer (1998)
Attouch, H., Wets, R.: A convergence theory for saddle functions. Trans. Am. Math. Soc. 280(1), 1–41 (1983)
Beer, G.: Topologies on Closed and Closed Convex Sets, Mathematics and its Applications, vol. 268. Kluwer, Dordrecht (1992)
Bagh, A.: Epi/hypo-convergence: the slice topology and saddle points approximation. J. Appl. Anal. 4, 13–39 (1996)
Fan, K.: A minimax inequality and applications. In: Shisha, O. (ed.) Inequalities-III, pp. 103–113. Academic Press, New York (1972)
Acknowledgments
This material is based upon work supported in part by the US Army Research Laboratory and the US Army Research Office under Grant Numbers 00101-80683, W911NF-10-1-0246 and W911NF-12-1-0273.
Author information
Authors and Affiliations
Corresponding author
Additional information
We dedicate this paper to our long-time friend, colleague, collaborator, and advisor Elijah (Lucien) Polak in honor of his outstanding career and to celebrate his 85th birthday. We wish him fair weather and following snow conditions.
Communicated by Igor Konnov.
Rights and permissions
About this article
Cite this article
Royset, J.O., Wets, R.JB. Optimality Functions and Lopsided Convergence. J Optim Theory Appl 169, 965–983 (2016). https://doi.org/10.1007/s10957-015-0839-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-015-0839-0
Keywords
- epi-Convergence
- Lopsided convergence
- Consistent approximations
- Optimality functions
- Optimality conditions