Given a strictly convex multiobjective optimization problem with objective functions f1,…,fNf_1,\dots,f_N, let us denote by x0x_0 its solution, obtained as minimum point of the linear scalarized problem, where the objective function is the convex combination of f1,…,fNf_1,\dots,f_N with weights t1,…,tNt_1,\ldots,t_N. The main result of this paper gives an estimation of the averaged error that we make if we approximate x0x_0 with the minimum point of the convex combinations of nn functions, chosen among f1,…,fNf_1,\dots,f_N, with probabilities t1,…,tNt_1,\ldots,t_N, respectively, and weighted with the same coefficient 1/n1/n. In particular, we prove that the averaged error considered above converges to 0 as nn goes to ∞\infty, uniformly w.r.t. the weights t1,…,tNt_1,\ldots,t_N. The key tool in the proof of our stochastic approximation theorem is a geometrical property, called by us small diameter property, ensuring that the minimum point of a convex combination of the functions f1,…,fNf_1,\dots,f_N continuously depends on the coefficients of the convex combination.

Contact details are reproduced from the original publication and may be historical.

Carlo Alberto De Bernardi

Dipartimento di Matematica per le Scienze Economiche, Finanziarie ed Attuariali, Università Cattolica del Sacro Cuore, Milano, Italy

carloalberto.debernardi@unicatt.it

Enrico Miglierina

Dipartimento di Matematica per le Scienze Economiche, Finanziarie ed Attuariali, Università Cattolica del Sacro Cuore, Milano, Italy

enrico.miglierina@unicatt.it

Elena Molho

Dipartimento di Scienze Economiche e Aziendali, Università degli Studi di Pavia, Pavia, Italy

elena.molho@unipv.it
  1. F. Albiac, N. Kalton: Topics in Banach Space Theory, Graduate Texts in Mathematics, Springer, New York (2006).Google Scholar
  2. B. Beauzamy, P. Enflo: Théorème de point fixe et d’approximation, Ark. Mat. 23 (1985) 19–34.https://doi.org/10.1007/BF02384417Google Scholar
  3. J. B. Collier: A class of strong differentiability spaces, Proc. Amer. Math. Soc. 53 (1975) 420–422.https://doi.org/10.1090/S0002-9939-1975-0388044-5Google Scholar
  4. C. A. De Bernardi, J. Somaglia: Rotund Gâteaux smooth norms which are not locally uniformly rotund, Proc. Amer. Math. Soc. 52/4 (2024) 1689–1701.https://doi.org/10.1090/proc/16659Google Scholar
  5. C. A. De Bernardi, J. Somaglia, L. Veselý: Star-finite coverings of Banach spaces, J. Math. Anal. Appl. 491 (2020), art. no. 124384, 21 pp.https://doi.org/10.1016/j.jmaa.2020.124384Google Scholar
  6. N. Dunford, J. T. Schwartz: Linear Operators. Part I: General theory, reprint of the 1958 original, John Wiley & Sons, New York (1988).Google Scholar
  7. M. Ehrgott: Multicriteria Optimization, 2nd ed., Springer, Berlin (2005).Google Scholar
  8. M. Fabian, P. Habala, P. Hájek, V. Montesinos, V. Zizler: Banach Space Theory. The Basis for Linear and Nonlinear Analysis, CMS Books in Mathematics / Ouvrages de Mathématiques de la SMC, Springer, New York (2011).https://doi.org/10.1007/978-1-4419-7515-7Google Scholar
  9. J. Jahn: Vector Optimization. Theory, Applications, and Extensions, Springer, Berlin (2004).https://doi.org/10.1007/978-3-540-24828-6Google Scholar
  10. D. T. Luc: Theory of Vector Optimization, Lecture Notes in Economics and Mathematical Systems 319, Springer, Berlin (1989).https://doi.org/10.1007/978-3-642-50280-4Google Scholar
  11. R. R. Phelps: Convex Functions, Monotone Operators and Differentiability, Lecture Notes in Mathematics 1364, Springer, Berlin (1993).Google Scholar
  12. M. Volle, C. Zălinescu: Strongly adequate functions on Banach spaces, J. Convex Analysis 20 (2013) 655–668.https://doi.org/10.68381/jca20037Google Scholar
  13. C. Zălinescu: On uniformly convex functions, J. Math. Anal. Appl. 95 (1983) 344–374.https://doi.org/10.1016/0022-247X(83)90112-9Google Scholar
  14. C. Zălinescu: Convex Analysis in General Vector Spaces, World Scientific Publishing, Singapore (2002).https://doi.org/10.1142/5021Google Scholar

C. A. De Bernardi, E. Miglierina, E. Molho, J. Somaglia. “Stochastic Approximation in Convex Multiobjective Optimization.” Journal of Convex Analysis 31 (2024), No. 3, 761–778. https://doi.org/10.68381/jca31037