Abstract
In this paper we consider the collection of convex programming problems with inequality and equality constraints, in which every problem of the collection is obtained by linear perturbations of the cost function and right-hand side perturbation of the constraints, while the ``core'' cost function and the left-hand side constraint functions are kept fixed. The main result shows that the set of the problems which are not well-posed is σ-porous in a certain strong sense. Our results concern both the infinite and finite dimensional case. In the last case the conclusions are significantly sharper.
Similar content being viewed by others
References
Asplund, E., Rockafellar, R.T.: Gradients of convex functions. Trans. Amer. Math. Soc. 139, 443–467 (1969)
Borwein, J.M.: Partially monotone operators and generic differentiability of concave-convex and biconvex functions. Israel J. Math. 54, 42–50 (1986)
Coban, M.M., Kenderov, P.S., Revalski, J.P.: Generic well-posedness of optimization problems in topological spaces. Mathematika 36, 301–324 (1989)
De Blasi, F.S., Myjak, J., Papini, P.L.: Porous sets in best approximation theory. J. London Math. Soc. 44, 135–142 (1991)
Deville, R., Godefroy, G., Zizler, V.: Smoothness and renormings in Banach spaces. Pitman Monographs and Surveys in Pure and Appl. Math. Longman Scientific & Technical, 1993
Deville, R., Revalski, J.P.: Porosity of ill-posed problems. Proc. Amer. Math. Soc. 128, 1117–1124 (2000)
Dontchev, A.L., Zolezzi, T.: Well-posed optimization problems. Lectures Notes in Mathematics Vol. 1543, Springer-Verlag, Berlin, 1993
Ioffe, A.D., Lucchetti, R.: Generic existence, uniqueness and stability in optimization, In: Nonlinear Optimization and Related Topics. G. Di Pillo and F. Giannessi (eds.), Kluwer Academic Publishers, Dordrecht, 2000, pp. 169–182
Ioffe, A.D., Lucchetti, R., Revalski, J.P.: A variational principle for problems with functional constraints, SIAM J. Optimization 12, 461–478 (2001)
Ioffe, A.D., Zaslavski, A.J.: Variational principles and well-posedness in optimization and calculus of variations. SIAM J. Control Optimization 38, 566–581 (2000)
Lucchetti, R., Zolezzi, T.: On well–posedness and stability analysis in optimization. In: Mathematical Programming with data perturbations, A.V. Fiacco Ed. M. Dekker, New York, 1997, pp. 223–252
Mignot, F.: Contrôle dans les inéquations variationnelles elliptiques. J. Funct. Analysis 22, 130–185 (1976)
Phelps, R.R.: Convex Functions, Monotone Operators and Differentiability. Lectures Notes in Mathematics Vol. 1364, Springer-Verlag, Berlin, 1992
Preiss, D., Zajíček, L.: Fréchet differentiation of convex functions in a Banach space with separable dual. Proc. Amer. Math. Soc. 91, 202–204 (1984)
Rockafellar, R.T.: Saddle points and convex analysis, in Differential games and related topics. H.W. Kuhn and G.P.Szegö eds. North Holland, 1971, pp. 109-128
Spingarn, J.E., Rockafellar, R.T.: The generic nature of optimality conditions in nonlinear programming. Math. Oper. Res. 4, 425–430 (1979)
Zajíček, L.: Porosity and σ-porosity. Real Anal. Exchange 13, 314–350 (1987)
Zaslavski, A.: Well-posedness and porosity in convex programming. Nonlinear An. Forum 8, 101-110 (2003)
Zolezzi, T.: Well-posedness criteria in optimization with application to the Calculus of variations. Nonlinear Anal., TMA 25, 437–453 (1995)
Zolezzi, T.: Extended well-posedness of optimization problems. J. Optim. Theory and Appl. 91, 57–268 (1996)
Author information
Authors and Affiliations
Corresponding author
Additional information
Research of A. Ioffe was supported in part by the US-Israel Binational Fund under the grant 2000157. research of R. E. Lucchetti was partially supported by Ministero dell'Istruzione, dell'Università e della Ricerca (COFIN 2001).
Rights and permissions
About this article
Cite this article
Ioffe, A., Lucchetti, R. Typical convex program is very well posed. Math. Program. 104, 483–499 (2005). https://doi.org/10.1007/s10107-005-0625-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0625-0