<?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">bsuir</journal-id><journal-title-group><journal-title xml:lang="ru">Доклады БГУИР</journal-title><trans-title-group xml:lang="en"><trans-title>Doklady BGUIR</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1729-7648</issn><issn pub-type="epub">2708-0382</issn><publisher><publisher-name>БГУИР</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">bsuir-1135</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>ELECTRONICS, RADIOPHYSICS, RADIOENGINEERING, INFORMATICS</subject></subj-group></article-categories><title-group><article-title>К УСЛОВИЯМ РЕГУЛЯРНОСТИ В МАТЕМАТИЧЕСКОМ ПРОГРАММИРОВАНИИ</article-title><trans-title-group xml:lang="en"><trans-title>On constraint qualifications in mathematical programming</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></bio><bio xml:lang="en"><p>D.Sci,  professor,  professor of informatics  department</p></bio><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>Sirotko</surname><given-names>S. I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Сиротко Сергей Иванович - к.ф.-м.н., доцент, доцент кафедры информатики</p><p>220013, г. Минск, ул. П. Бровки, 6</p><p>+375-17-293-86-66</p></bio><bio xml:lang="en"><p>Sirotko Sergey Ivanovich - PhD, associate professor, associate professor of informatics department </p><p>220013 Republic of Belarus, Minsk, P. Brovka st., 6</p><p>+375-17-293-86-66</p></bio><email xlink:type="simple">sergeyis@bsuir.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники</institution><country>Беларусь</country></aff><aff xml:lang="en"><institution>Belarusian state university of informatics and radioelectronics</institution><country>Belarus</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2018</year></pub-date><pub-date pub-type="epub"><day>06</day><month>06</month><year>2019</year></pub-date><volume>0</volume><issue>8</issue><fpage>76</fpage><lpage>80</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., Sirotko S.I.</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://doklady.bsuir.by/jour/article/view/1135">https://doklady.bsuir.by/jour/article/view/1135</self-uri><abstract><p>Статья посвящена условию R-регулярности (Error Bound Property) в задачах математического программирования. Данное условие играет важную роль в анализе сходимости численных алгоритмов оптимизации и является достаточно общим условием регулярности (constraint qualification) в задачах математического программирования. В статье получаются новые достаточные условия наличия R-регулярности в задачах математического программирования.</p></abstract><trans-abstract xml:lang="en"><p>The article is devoted to the condition of R-regularity (Error Bound Property) in problems of mathematical programming. This condition plays an important role in analyzing the convergence of numerical optimization algorithms and it is a fairly general condition of regularity (constraint qualification) in problems of mathematical programming. The article obtains new sufficient conditions for the presence of R-regularity in problems of mathematical programming.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>математическое программирование</kwd><kwd>условия регулярности</kwd><kwd>error bound</kwd></kwd-group><kwd-group xml:lang="en"><kwd>mathematical programming</kwd><kwd>constraint qualifications</kwd><kwd>error bound</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">Hoffman A.J. On approximate solutions of systems of linear inequalities // J. Res. Natl. Bureau Stand. 1952. Vol. 49. P. 263–265.</mixed-citation><mixed-citation xml:lang="en">Hoffman A.J. On approximate solutions of systems of linear inequalities. // J. Res. Natl. Bureau Stand. 1952. Vol. 49. P. 263–265.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Luderer B., Minchenko L., Satsura T. Multivalued analysis and nonlinear programming problems with perturbations. Kluwer Acad. Publ., Dordreht, 2002. 220 p.</mixed-citation><mixed-citation xml:lang="en">Luderer B., Minchenko L., Satsura T. Multivalued analysis and nonlinear programming problems with perturbations. Kluwer Acad. Publ., Dordreht, 2002. 220 p.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Error Bounds: Necessary and Sufficient Conditions / M.J. Fabian [et al.] // Set-Valued and Variational Analysis. 2010. Vol. 18 (2). P. 121–149.</mixed-citation><mixed-citation xml:lang="en">Error Bounds: Necessary and Sufficient Conditions / M.J. Fabian [et al.] // Set-Valued and Variational Analysis. 2010. Vol. 18 (2). P. 121–149.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Minchenko L.I., Stakhovski S.M. On relaxed constant rank regularity condition in mathematical programming. // Optimization. 2011. Vol. 60. P. 429–440.</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. P. 429–440.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Minchenko L., Tarakanov A. On error bounds for quasinormal programs // J. Optim. Theory and Appl., 2011. Vol. 148. P. 571–579.</mixed-citation><mixed-citation xml:lang="en">Minchenko L., Tarakanov A. On error bounds for quasinormal programs // J. Optim. Theory and Appl., 2011. Vol. 148. P. 571–579.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Минченко Л.И., Стаховский С.М. К обобщению условий регулярности Мангасаряна-Фромовица // Докл. БГУИР. 2010. № 8 (62). С. 104–109.</mixed-citation><mixed-citation xml:lang="en">Minchenko L.I., Stahovskij S.M. K obobshheniju uslovij reguljarnosti Mangasarjana-Fromovica // Dokl. BGUIR. 2010. № 8 (62). S. 104–109. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kruger A.Y., Minchenko L.I., Outrata J.V. On relaxing the Mangasarain–Fromovitz constaint qualication // Positivity. 2013. Vol. 17. P. 1–17.</mixed-citation><mixed-citation xml:lang="en">Kruger A.Y., Minchenko L.I., Outrata J.V. On relaxing the Mangasarain–Fromovitz constaint qualication // Positivity. 2013. Vol. 17. P. 1–17.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Mangasarian O. L., Fromovitz S. The Fritz-John necessary optimality conditions in presence of equality and inequality constraints // J. Mathem. Anal. and Appl. 1967. Vol. 17. P. 37–47.</mixed-citation><mixed-citation xml:lang="en">Mangasarian O. L., Fromovitz S. The Fritz-John necessary optimality conditions in presence of equality and inequality constraints // J. Mathem. Anal. and Appl. 1967. Vol. 17. P. 37–47.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Janin R. Direction derivative of the marginal function in nonlinear programming // Mathematical Programming Study. 1984. Vol. 21. P. 127–138.</mixed-citation><mixed-citation xml:lang="en">Janin R. Direction derivative of the marginal function in nonlinear programming // Mathematical Programming Study. 1984. Vol. 21. P. 127–138.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Bertsekas D.P., Ozdaglar A.E. The relation between pseudonormality and quasiregularity in constrained optimization // Optimization Methods and Software. 2004. Vol. 19. P. 493–506.</mixed-citation><mixed-citation xml:lang="en">Bertsekas D.P., Ozdaglar A.E. The relation between pseudonormality and quasiregularity in constrained optimization // Optimization Methods and Software. 2004. Vol. 19. P. 493–506.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Гороховик В.В. Конечномерные задачи оптимизации. Минск: Изд.БГУ, 2007. 239 c.</mixed-citation><mixed-citation xml:lang="en">Gorohovik V.V. Konechnomernye zadachi optimizacii. Minsk: Izd.BGU, 2007. 239 s. (in Russ.)</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Rockafellar R.T., Wets R.J.-B. Variational analysis. Springer, Berlin, 1998. 749 p.</mixed-citation><mixed-citation xml:lang="en">Rockafellar R.T., Wets R.J.-B. Variational analysis. Springer, Berlin, 1998. 749 p.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Bounkhel M. Regularity concepts in nonsmooth analysis. Theory and applications. Springer, 2012. 264 p.</mixed-citation><mixed-citation xml:lang="en">Bounkhel M. Regularity concepts in nonsmooth analysis. Theory and applications. Springer, 2012. 264 p.</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>
