Almost every convex or quadratic programming problem is well posed

Mathematics of Operations Research

Volumn 29, Issue 2, 2004, Pages 369-382

  Ioffe, A D ^a   Lucchetti, R E ^b   Revalski, J P ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b POLITECNICO DI MILANO   (Italy)

^c INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

Author keywords

(Quasi) convex problem; Baire category; Lebesgue measure zero; Porous set; Quadratic mathematical programming problem; Well posed problem

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; NONLINEAR PROGRAMMING; SET THEORY;

BAIRE CATEGORY; LEBESGUE MEASURE ZERO; POROUS SET; WELL POSED PROBLEMS;

QUADRATIC PROGRAMMING;

EID: 4043067075     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.1030.0080     Document Type: Article

References (18)

1. Čoban, M. M., P. S. Kenderov. J. P. Revalski. 1994. Densely defined selections of multivalued mappings. Trans. Amer. Math. Soc. 344 533-552.
2. Čoban, M. M., P. S. Kenderov, J. P. Revalski. 1995. Topological spaces related to the Banach-Mazur game and generic properties of optimization problems. Set-Valued Anal. 3 263-279.
3. De Blasi, F. S., J. Myjak, P. L. Papini. 1991. Porous sets in best approximation theory. J. London Math. Soc. 44 135-142.
4. Deville, R., J. P. Revalski. 2000. Porosity of ill-posed problems. Proc. Amer: Math. Soc. 128 1117-1124.
5. Deville, R., G. Godefroy, V. Zizler. 1991. Smoothness and renormings in Banach spaces. Pitman Monographs and Surveys in Pure and Appl. Math. Longman Group UK Limited, London, U.K.
6. Dontchev, A. L., T. Zolezzi. 1993. Well-posed optimization problems. Lectures Notes in Mathematics, No. 1543. Springer-Verlag, Berlin, Germany.
7. Ioffe, A. D., R. Lucchetti. 2000. Generic existence, uniqueness and stability in optimization. G. Di Pillo, F. Giannessi, eds. Nonlinear Optimization and Related Topics. Kluwer Academic Publishers, Dordrecht, The Netherlands. 169-182.
8. Ioffe, A. D., A. J. Zaslavski. 2000. Variational principles and well-posedness in optimization and calculus of variations. SIAM J. Control Optim. 38 566-581.
9. Ioffe, A. D., R. Lucchetti, J. P. Revalski. 2001. A variational principle for problems with functional constraints. SIAM J. Optim. 12 461-478.
10. Kenderov, P. S., J. P. Revalski. 1995. Generic well-posedness of optimization problems and the Banach-Mazur game. R. Lucchetti, J. P. Revalski, eds. Recent Developments in Well-Posed Variational Problems. Mathematics and Its Applications, Vol. 331. Kluwer Academic Publishers, Dordrecht, The Netherlands, 117-136.
11. Lucchetti, R., T. Zolezzi. 1997. On well-posedness and stability analysis in optimization. A. V. Fiacco, ed. Mathematical Programming with Data Perturbations. M. Dekker, New York, 223-252.
12. Marchini, E. 2002. Porosity and variational principles. Serdica Math. J. 28 37-46.
13. Revalski, J. P. 1987. Generic properties in some classes of optimization problems. Acta. Univ. Carolinae Math. Phys. 28 117-125.
14. Spingarn, J. E., R. T. Rockafellar. 1979. The generic nature of optimality conditions in nonlinear programming. Math. Oper. Res. 4 425-430.
15. n and its application to some classes of optimization problems. C. R. Acad. Bulgarian Sci. 42 29-31.
16. Zajíček, L. 1987-88. Porosity and σ-porosity. Real Anal. Exchange 13 314-350.
17. Zolezzi, T. 1995. Wellposedness criteria in optimization with application to the calculus of variations. Nonlinear Anal. Theory Methods Appl. 25 437-453.
18. Zolezzi, T. 1996. Extended well-posedness of optimization problems. J.