<?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 custom-type="elpub" pub-id-type="custom">vestifm-26</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>WEAK SECOND-ORDER OPTIMALITY CONDITIONS</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>Leschov</surname><given-names>A. E.</given-names></name></name-alternatives><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>2015</year></pub-date><pub-date pub-type="epub"><day>16</day><month>05</month><year>2016</year></pub-date><volume>0</volume><issue>1</issue><fpage>60</fpage><lpage>67</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Лещёв А.Е., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Лещёв А.Е.</copyright-holder><copyright-holder xml:lang="en">Leschov A.E.</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/26">https://vestifm.belnauka.by/jour/article/view/26</self-uri><abstract><p>Данная статья ставит своей целью вывод слабых необходимых условий оптимальности второго порядка при менее жестких требованиях по сравнению с известными ранее в литературе. Для доказательства необходимых условий оптимальности применяется метод штрафных функций.</p></abstract><trans-abstract xml:lang="en"><p>The aim of the present article is to derive so-called weak second-order necessary optimality conditions for nonlinear programming problems. Necessary weak second-order optimality conditions are proved under some additional requirements to the constraints.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Габасов Р. Ф., Кириллова Ф. М. Методы оптимизации. Минск, 1981.</mixed-citation><mixed-citation xml:lang="en">Габасов Р. Ф., Кириллова Ф. М. Методы оптимизации. Минск, 1981.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Гороховик В. В. Конечномерные задачи оптимизации. Минск, 2007.</mixed-citation><mixed-citation xml:lang="en">Гороховик В. В. Конечномерные задачи оптимизации. Минск, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Ioffe A. D. // SIAM J. Control Optimiz. 1979. Vol. 17. P. 266-288.</mixed-citation><mixed-citation xml:lang="en">Ioffe A. D. // SIAM J. Control Optimiz. 1979. Vol. 17. P. 266-288.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Bonnans J. F., Shapiro A. Perturbation Analysis of Optimization Problems. New York, 2000.</mixed-citation><mixed-citation xml:lang="en">Bonnans J. F., Shapiro A. Perturbation Analysis of Optimization Problems. New York, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Luderer B., Minchenko L., Satsura T. Multivalued analysis and nonlinear programming problems with perturbations. Dordrecht. 2002</mixed-citation><mixed-citation xml:lang="en">Luderer B., Minchenko L., Satsura T. Multivalued analysis and nonlinear programming problems with perturbations. Dordrecht. 2002</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">FiaccoA. V., McCormick G. P. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. New York, 1968.</mixed-citation><mixed-citation xml:lang="en">FiaccoA. V., McCormick G. P. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. New York, 1968.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Bertsekas D. P. Nonlinear Programming. Massachusetts, 1999.</mixed-citation><mixed-citation xml:lang="en">Bertsekas D. P. Nonlinear Programming. Massachusetts, 1999.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Guo L., Lin G. H, Ye J. J. // J. Optimiz. Theory. Appl. 2013. Vol. 158. P. 33-64.</mixed-citation><mixed-citation xml:lang="en">Guo L., Lin G. H, Ye J. J. // J. Optimiz. Theory. Appl. 2013. Vol. 158. P. 33-64.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">FletcherR. Practical Methods of Optimization. London, 1987.</mixed-citation><mixed-citation xml:lang="en">FletcherR. Practical Methods of Optimization. London, 1987.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Nocedal J., Wright S. J. Numerical Optimization. New York, 1999.</mixed-citation><mixed-citation xml:lang="en">Nocedal J., Wright S. J. Numerical Optimization. New York, 1999.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Baccari A., Trad A. // SIAM J. Optimization. 2004. Vol. 15. P. 394-408.</mixed-citation><mixed-citation xml:lang="en">Baccari A., Trad A. // SIAM J. Optimization. 2004. Vol. 15. P. 394-408.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Echague C. E., SchuverdtM. L. // J. Optim. Theory Appl. 2010. Vol. 146. P. 255-266.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Echague C. E., SchuverdtM. L. // J. Optim. Theory Appl. 2010. Vol. 146. P. 255-266.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">MinchenkoL., StakhovskiS. // SIAM J. Optimiz. 2011. Vol. 21. P. 314-332.</mixed-citation><mixed-citation xml:lang="en">MinchenkoL., StakhovskiS. // SIAM J. Optimiz. 2011. Vol. 21. P. 314-332.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">McCormick G. P. // SIAM J. Appl. Math. 1967. Vol. 15. P. 641-652.</mixed-citation><mixed-citation xml:lang="en">McCormick G. P. // SIAM J. Appl. Math. 1967. Vol. 15. P. 641-652.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Gould N. I. M., TointP. L. // Math. Program. 1999. Vol. 85. P. 433-438.</mixed-citation><mixed-citation xml:lang="en">Gould N. I. M., TointP. L. // Math. Program. 1999. Vol. 85. P. 433-438.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Andreani R., Martinez J. M., Schuverdt M. L. // Optimization. 2007. Vol. 56. P. 529-542.</mixed-citation><mixed-citation xml:lang="en">Andreani R., Martinez J. M., Schuverdt M. L. // Optimization. 2007. Vol. 56. P. 529-542.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">HuX. M., Ralph D. // J. Optim. Theory and Appl. 2004. Vol. 123. P. 365-390.</mixed-citation><mixed-citation xml:lang="en">HuX. M., Ralph D. // J. Optim. Theory and Appl. 2004. Vol. 123. P. 365-390.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Izmailov A. F., Solodov M. V // SIAM J. Optim. 2008. Vol. 19. P. 1003-1027.</mixed-citation><mixed-citation xml:lang="en">Izmailov A. F., Solodov M. V // SIAM J. Optim. 2008. Vol. 19. P. 1003-1027.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Минченко Л. И., Лещев А. Е. // Докл. НАН Беларуси. 2013. Т. 57, № 6. С. 28-34.</mixed-citation><mixed-citation xml:lang="en">Минченко Л. И., Лещев А. Е. // Докл. НАН Беларуси. 2013. Т. 57, № 6. С. 28-34.</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>
