Sufficient condition for pseudo-lipschitzian continuity of a family of equalities and inequalities
https://doi.org/10.29235/1561-2430-2019-55-3-283-287
Abstract
We study the Lipschitz-like properties of multivalued mappings defined by functional parametric equalities and inequalities. Sufficient conditions of pseudo-Lipschitzian continuity are obtained on the basе of the regularity condition of the relaxed constant positive linear dependence (RCPLD) by Andreani et al. The results of the article generalize some known sufficient conditions for pseudo-Lipschitzian continuity of the systems of parametric equalities and inequalities.
About the Authors
L. I. Minchenko
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Leonid I. Minchenko – Dr. Sc. (Physics and Ma thematics), Professor, Professor of the Department of Informatics
6, P. Brovka Str., 220013, Minsk, Republic of Belarus
O. F. Borisenko
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Oleg F. Borisenko – Ph. D. (Physics and Mathematics), Associate Professor, Associate Professor of the Department of Higher Mathematics
6, P. Brovka Str., 220013, Minsk, Republic of Belarus
References
1. Aubin J.-P. Lipschitz behavior of solutions to convex minimization problems/J.-P. Mathematics of Operations Research, 1984, vol. 9, no. 1, pp. 97–111. https://doi.org/10.1287/moor.9.1.87
2. Rockafellar R. T., Wets R. J.-B. Variational Analysis. Berlin, Springer, 1998. https://doi.org/10.1007/978-3-642-02431-3
3. Minchenko L., Stakhovski S. Parametric nonlinear programming problems under the relaxed constant rank condition. SIAM Journal on Optimization, 2011, vol. 21, no. 1, pp. 314–332. https://doi.org/10.1137/090761318
4. Lu S. Relation between the constant rank and the relaxed constant rank constraint qualifications. Optimization, 2012, vol. 61, no. 5, pp. 555–566. https://doi.org/10.1080/02331934.2010.527972
5. Bednarczuk E., Rutkowski K. E. On Lipschitz-like property to polyhedral moving sets. SIAM Journal on Optimization, 2019, vol. 29, pp. 3197–3207.
6. Andreani R., Haeser G., Schuverdt M. L., Silva P. J. S. A relaxed constant positive linear dependence constraint qualification and applications. Mathematical Programming, 2012, vol. 135, no. 1–2, pp. 255–273. https://doi.org/10.1007/s10107-011-0456-0
7. Fedorov V. V. Numerical Maximilian Methods. Moscow, Nauka Publ., 1979. 280 p. (in Russian).
8. Luderer B., Minchenko L., Satsura T. Multivalued Analysis and Nonlinear Programming Problems with Perturbations. Dordrecht, Kluwer Acad. Publ., 2002. https://doi.org/10.1007/978-1-4757-3468-3
9. Minchenko L. I., Stakhovski S. M. On relaxed constant rank regularity condition in mathematical programming. Optimization, 2011, vol. 60, no. 4, pp. 429–440. https://doi.org/10.1080/02331930902971377
10. Kuhn H. W., Tucker A. W. Nonlinear Programming. Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. Berkeley, University of California Press, 1951, pp. 481–492.
Review
Views: 1149
Email this article 