1. Aubin, J.-P. Lipschitz behavior of solutions to convex minimization problems / J.-P. Aubin // Math. Oper. Res. - 1984. - Vol. 9, № 1. - P. 97-111. https://doi.org/10.1287/moor.9.1.87
2. Rockafellar, R. T. Variational Analysis / R. T. Rockafellar, R. J.-B. Wets. - Berlin: Springer, 1998. https://doi.org/10.1007/978-3-642-02431-3
3. Minchenko, L. Parametric nonlinear programming problems under the relaxed constant rank condition / L. Minchenko, S. Stakhovski // SIAM J. Optimiz. - 2011. - Vol. 21, № 1. - P. 314-332. https://doi.org/10.1137/090761318
4. Lu, S. Relation between the constant rank and the relaxed constant rank constraint qualifications / S. Lu // Optimization. - 2012. - Vol. 61, № 5. - P. 555-566. https://doi.org/10.1080/02331934.2010.527972
5. Bednarczuk, E. On Lipschitz-like property to polyhedral moving sets / E. Bednarczuk, K. E. Rutkowski // SIAM J. Optimiz. - 2019. - Vol. 29. - P. 3197-3207.
6. A relaxed constant positive linear dependence constraint qualification and applications / R. Andreani [et al.] // Math. Program. - 2012. - Vol. 135, № 1/2. - P. 255-273. https://doi.org/10.1007/s10107-011-0456-0
7. Федоров, В. В. Численные методы максимина / В. В. Федоров. - М.: Наука, 1979. - 280 с.
8. Luderer, B. Multivalued analysis and nonlinear programming problems with perturbations / B. Luderer, L. Minchenko, T. Satsura. - Dordrecht: Kluwer Acad. Publ., 2002. https://doi.org/10.1007/978-1-4757-3468-3
9. Minchenko, L. I. On relaxed constant rank regularity condition in mathematical programming / L. I. Minchenko, S. M. Stakhovski // Optimization. - 2011. - Vol. 60, № 4. - P. 429-440. https://doi.org/10.1080/02331930902971377
10. Kuhn, H. W. Nonlinear Programming / H. W. Kuhn, A. W. Tucker/ / Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. - Berkeley: University of California Press, 1951. - P. 481-492.
Послать статью по эл. почте 