<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.29235/1561-2430-2019-55-3-283-287</article-id><article-id custom-type="elpub" pub-id-type="custom">vestifm-397</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MATHEMATICS</subject></subj-group></article-categories><title-group><article-title>Достаточное условие псевдолипшицевости системы параметрических равенств и неравенств</article-title><trans-title-group xml:lang="en"><trans-title>Sufficient condition for pseudo-lipschitzian continuity of a family of equalities and inequalities</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Минченко</surname><given-names>Л. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Minchenko</surname><given-names>L. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Минченко Леонид Иванович – доктор физико-математических наук, профессор, профессор кафедры информатики</p><p>ул. П. Бровки, 6, 220013, г. Минск, Республика Беларусь</p></bio><bio xml:lang="en"><p>Leonid I. Minchenko – Dr. Sc. (Physics and Ma thematics), Professor, Professor of the Department of Informatics</p><p>6, P. Brovka Str., 220013, Minsk, Republic of Belarus</p></bio><email xlink:type="simple">inform@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Борисенко</surname><given-names>О. Ф.</given-names></name><name name-style="western" xml:lang="en"><surname>Borisenko</surname><given-names>O. F.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Борисенко Олег Федорович – кандидат физико-математических наук, доцент, доцент кафедры высшей математики</p><p>ул. П. Бровки, 6, 220013, г. Минск, Республика Беларусь</p></bio><bio xml:lang="en"><p>Oleg F. Borisenko – Ph. D. (Physics and Mathematics), Associate Professor, Associate Professor of the Department of Higher Mathematics</p><p>6, P. Brovka Str., 220013, Minsk, Republic of Belarus</p></bio><email xlink:type="simple">kafvm@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2019</year></pub-date><pub-date pub-type="epub"><day>04</day><month>10</month><year>2019</year></pub-date><volume>55</volume><issue>3</issue><fpage>283</fpage><lpage>287</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Минченко Л.И., Борисенко О.Ф., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Минченко Л.И., Борисенко О.Ф.</copyright-holder><copyright-holder xml:lang="en">Minchenko L.I., Borisenko O.F.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestifm.belnauka.by/jour/article/view/397">https://vestifm.belnauka.by/jour/article/view/397</self-uri><abstract><p>Исследуются липшицевы свойства многозначных отображений, заданных в виде системы параметрических равенств и неравенств. Доказываются достаточные условия псевдолипшицевости (pseudo-Lipschitzian continuity or Aubin property) на основе ослабленного условия регулярности постоянства положительно-линейной зависимости (RCPLD). За счет использования более слабых условий регулярности полученные результаты обобщают некоторые известные ранее достаточные условия псевдолипшицевости для многозначных отображений, заданных системой функциональных равенств и неравенств.</p></abstract><trans-abstract xml:lang="en"><p>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.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>многозначные отображения</kwd><kwd>условия регулярности</kwd><kwd>псевдолипшицевость</kwd></kwd-group><kwd-group xml:lang="en"><kwd>multivalued mappings</kwd><kwd>constraint qualifications</kwd><kwd>pseudo-Lipschitzian continuity</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">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</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">Rockafellar R. T., Wets R. J.-B. Variational Analysis. Berlin, Springer, 1998. https://doi.org/10.1007/978-3-642-02431-3</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">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</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">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</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Bednarczuk, E. On Lipschitz-like property to polyhedral moving sets / E. Bednarczuk, K. E. Rutkowski // SIAM J. Optimiz. – 2019. – Vol. 29. – P. 3197–3207.</mixed-citation><mixed-citation xml:lang="en">Bednarczuk E., Rutkowski K. E. On Lipschitz-like property to polyhedral moving sets. SIAM Journal on Optimization, 2019, vol. 29, pp. 3197–3207.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">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</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Федоров, В. В. Численные методы максимина / В. В. Федоров. – М.: Наука, 1979. – 280 с.</mixed-citation><mixed-citation xml:lang="en">Fedorov V. V. Numerical Maximilian Methods. Moscow, Nauka Publ., 1979. 280 p. (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">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</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">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</mixed-citation><mixed-citation xml:lang="en">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</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">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.</mixed-citation><mixed-citation xml:lang="en">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.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
