Abstract
Various notions of condition numbers are used to study some sensitivity aspects of scalar optimization problems. The aim of this paper is to introduce a notion of condition number to study the case of a multiobjective optimization problem defined via m convex C 1,1 objective functions on a given closed ball in ℝn. Two approaches are proposed: the first one adopts a local point of view around a given solution point, whereas the second one considers the solution set as a whole. A comparison between the two notions of well-conditioned problem is developed. We underline that both the condition numbers introduced in the present work reduce to the same condition number proposed by Zolezzi in 2003, in the special case of the scalar optimization problem considered there. A pseudodistance between functions is defined such that the condition number provides an upper bound on how far from a well–conditioned function f a perturbed function g can be chosen in order that g is well–conditioned too. For both the local and the global approach an extension of classical Eckart–Young distance theorem is proved, even if only a special class of perturbations is considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aubin, J.P., Cellina, A.: Differential Inclusions. Springer (1984)
Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings. Springer (2009)
Dontchev, A.L., Lewis, A.S., Rockafellar, R.T.: The radius of metric regularity. Trans. Amer. Math. Soc. 355, 493–517 (2003)
Jahn, J.: Vector Optimization. Springer (2004)
Lee, G.M., Kim, D.S., Lee, B.S., Yen, N.D.: Vector variational inequality as a tool for studying vector optimization problems. Nonlinear Anal. 34, 745–765 (1998)
Lewis, A.S.: Ill-conditioned convex processes and conic linear systems. Math. Oper. Res. 24, 829–834 (1999)
Lim, T.-C.: On fixed point stability for set-valued contractive mappings with applications to generalized differential equations. J. Math. Anal. Appl. 110, 436–441 (1985)
Luc, D.T.: Theory of Vector Optimization. Springer (1989)
Miglierina, E.: Slow solutions of a differential inclusions and vector optimization. Set-Valued Anal. 12, 345–356 (2004)
Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory. Springer (2006)
Nadler, S.B.: Multivalued contraction mappings. Pac. J. Math. 30, 475–488 (1969)
Renegar, J.: Incorporating condition measures into the complexity theory of linear programming. SIAM J. Optim. 5, 506–524 (1995)
Renegar, J.: Linear programming, complexity theory and elementary functional analysis. Math. Programming 70, 279–351 (1995)
Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43–62 (1980)
Zolezzi, T.: On the distance theorem in quadratic optimization. J. Convex Anal. 9, 693–700 (2002)
Vial, J.-P.: Strong and weak convexity of sets and functions. Math. Oper. Res. 8, 231–259 (1983)
Zolezzi, T.: Condition number theorems in optimization, SIAM J. Optim. 14, 507–516 (2003)
Rockafellar, R.T., Wets, R.J-B.: Variational Analysis. Springer (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bianchi, M., Miglierina, E., Molho, E. et al. Some Results on Condition Numbers in Convex Multiobjective Optimization. Set-Valued Var. Anal 21, 47–65 (2013). https://doi.org/10.1007/s11228-012-0207-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11228-012-0207-2