<?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">pribor</journal-id><journal-title-group><journal-title xml:lang="ru">Известия высших учебных заведений. Приборостроение</journal-title><trans-title-group xml:lang="en"><trans-title>Journal of Instrument Engineering</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">0021-3454</issn><issn pub-type="epub">2500-0381</issn><publisher><publisher-name>Национальный исследовательский университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/0021-3454-2025-68-10-838-843</article-id><article-id custom-type="elpub" pub-id-type="custom">pribor-416</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>SYSTEM ANALYSIS, MANAGEMENT AND INFORMATION PROCESSING</subject></subj-group></article-categories><title-group><article-title>Аналитический метод поиска неизвестных постоянных параметров линейных регрессионных неравенств</article-title><trans-title-group xml:lang="en"><trans-title>Analytical method for finding unknown constant parameters of linear regression 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>Zenkin</surname><given-names>A. M.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Артемий Михайлович Зенкин — аспирант, факультет систем управления и робототехники; ассистент</p><p>Санкт-Петербург</p></bio><bio xml:lang="en"><p>Artemii M. Zenkin — Faculty of Control Systems and Robotics; Assistant</p><p>St. Petersburg</p></bio><email xlink:type="simple">a.zenkin@itmo.ru</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>Bobtsov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Алексей Алексеевич Бобцов — д-р техн. наук, профессор; факультет систем управления и робототехники; профессор</p><p>Санкт-Петербург</p></bio><bio xml:lang="en"><p>Alexey A. Bobtsov — PhD, Professor; Faculty of Control Systems and Robotics</p><p>St. Petersburg</p></bio><email xlink:type="simple">bobtsov@mail.ru</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>ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2025</year></pub-date><pub-date pub-type="epub"><day>15</day><month>11</month><year>2025</year></pub-date><volume>68</volume><issue>10</issue><fpage>838</fpage><lpage>843</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Национальный исследовательский университет ИТМО, 2025</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="ru">Национальный исследовательский университет ИТМО</copyright-holder><copyright-holder xml:lang="en">Национальный исследовательский университет ИТМО</copyright-holder><license xlink:href="https://pribor.ifmo.ru/jour/about/submissions#copyrightNotice" xlink:type="simple"><license-p>https://pribor.ifmo.ru/jour/about/submissions#copyrightNotice</license-p></license></permissions><self-uri xlink:href="https://pribor.ifmo.ru/jour/article/view/416">https://pribor.ifmo.ru/jour/article/view/416</self-uri><abstract><p>Рассмотрена система линейных регрессионных неравенств с неизвестными постоянными параметрами, число которых предполагается заданным и конечным. Решена задача построения области компонент допустимых значений параметров, обеспечивающих выполнение заданных неравенств. Предложен метод, основанный на процедуре динамического расширения регрессора и выборе активных ограничений — неравенств, обращающихся в равенства на границе области допустимых параметров, — что позволяет свести исходную задачу к решению квадратной системы линейных уравнений. Применение формулы Крамера и неравенства Адамара к полученной системе позволяет получить аналитическую верхнюю оценку ее неизвестных параметров. Корректность предложенного метода иллюстрируется численным моделированием, в отличие от численных методов оптимизации, он не требует итерационных вычислений и обеспечивает строгую гарантированную оценку, справедливую для всего класса допустимых данных. Сформулирована и доказана теорема, устанавливающая указанную оценку в общем случае. </p></abstract><trans-abstract xml:lang="en"><p>A system of linear regression inequalities with unknown constant parameters, whose number is assumed to be given and finite, is considered. The problem of constructing the domain of the components of the vector of unknown parameters that ensure the validity of the prescribed inequalities is addressed. A method is proposed, based on the procedure of dynamic regressor extension and the selection of active constraints, which reduces the original problem to solving a square system of linear equations. The application of Cramer’s rule and Hadamard’s inequality to the resulting system makes it possible to obtain an analytical upper bound for the components of the vector of unknown parameters. The correctness of the proposed method is illustrated by numerical simulation. Unlike numerical optimization methods, the presented approach does not require iterative computations and provides a rigorous guaranteed bound valid for the entire class of admissible data. A theorem establishing this bound in the general case is formulated and proved. The conclusion discusses the prospects for further development of the proposed approach. </p></trans-abstract><kwd-group xml:lang="ru"><kwd>линейное регрессионное неравенство</kwd><kwd>динамическое расширение регрессора</kwd><kwd>формула Крамера</kwd><kwd>неравенство Адамара</kwd></kwd-group><kwd-group xml:lang="en"><kwd>linear regression inequality</kwd><kwd>dynamic regressor extension</kwd><kwd>Cramer’s rule</kwd><kwd>Hadamard’s inequality</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">Schollmeyer G., Augustin T. Statistical modeling under partial identification: Distinguishing three types of identification regions in regression analysis with interval data // International Journal of Approximate Reasoning. 2015. Vol. 56, pt. B. P. 224–248. DOI: 10.1016/j.ijar.2014.07.003.</mixed-citation><mixed-citation xml:lang="en">Schollmeyer G., Augustin T. International Journal of Approximate Reasoning, 2015, vol. 56, pt. B, рр. 224–248, DOI: 10.1016/j.ijar.2014.07.003.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Ben-Moshe D. Identification of linear regressions with errors in all variables // Econometric Theory. 2021. Vol. 37, N 4. P. 633–663. DOI: 10.1017/S0266466620000250.</mixed-citation><mixed-citation xml:lang="en">Ben-Moshe D. Econometric Theory, 2021, no. 4(37), pp. 633–663, DOI: 10.1017/S0266466620000250.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Löhne A., Weißing B., Ciripoi A. A solution method for arbitrary polyhedral convex set optimization problems, 2023 [Электронный ресурс]: https://arxiv.org/html/2310.06602v3/.</mixed-citation><mixed-citation xml:lang="en">Löhne A., Weißing B., Ciripoi A. Optimization, 2024, https://arxiv.org/html/2310.06602v3/.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ziegler G. M., Henk M., Richter-Gebert J. Basic Properties of Convex Polytopes // Handbook of Discrete and Computational Geometry. Boca Raton: CRC Press, 2017. P. 383–413.</mixed-citation><mixed-citation xml:lang="en">Ziegler G.M.., Henk M., Richter-Gebert J. Handbook of Discrete and Computational Geometry, Boca Raton, CRC Press, 2017, рр. 383–413.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Cánovas M. J., Parra J. Lipschitz stability in convex optimization // Set-Valued and Variational Analysis. 2025. Vol. 33, N 3. P. 25–49. DOI: 10.1007/s11228-025-00760-8.</mixed-citation><mixed-citation xml:lang="en">Cánovas M.J., Parra J. Set-Valued and Variational Analysis, 2025, no. 3(33), pp. 25–49, DOI: 10.1007/s11228-025-00760-8.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Nwaigwe E., Wobo O. G. Application of Cramer’s Rule and Digital Computing in Analyzing Multiple Linear Regression // FNAS Journal of Mathematics, Statistics and Computing. 2024. Vol. 2, N 1. Р. 66–73.</mixed-citation><mixed-citation xml:lang="en">Nwaigwe E., Wobo O.G. FNAS Journal of Mathematics, Statistics and Computing, 2024, no. 1(2), pp. 66–73.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Hu H., Sremac S., Woerdeman H. J., Wolkowicz H. Finding a Maximal Determinant Principal Submatrix via Hadamard’s Inequality and Conic Relaxations // arXiv:2508.15608. 2025.</mixed-citation><mixed-citation xml:lang="en">Hu H., Sremac S., Woerdeman H.J., Wolkowicz H., arXiv:2508.15608, 2025.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Hillar C. J., Wibisono A. A Hadamard-type lower bound for symmetric diagonally dominant positive matrices // Linear Algebra and its Applications. 2015. Vol. 472. Р. 135–141. DOI:10.1016/j.laa.2015.01.037.</mixed-citation><mixed-citation xml:lang="en">Hillar C.J., Wibisono A. Linear Algebra and its Applications, 2015, vol. 472, рр. 135–141, DOI:10.1016/j.laa.2015.01.037.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Hadamard J. Résolution d’une question relative aux déterminants // Bulletin des Sciences Mathématiques. 1893. Vol. 17. P. 240–246.</mixed-citation><mixed-citation xml:lang="en">Hadamard J. Bulletin des Sciences Mathématiques, 1893, vol. 17, рр. 240–246.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Aranovskiy S., Bobtsov A., Ortega R., Pyrkin A. Performance Enhancement of Parameter Estimators via Dynamic Regressor Extension and Mixing // IEEE Transactions on Automatic Control. 2017. Vol. 62, is. 7. P. 3546–3550. DOI: 10.1109/TAC.2016.2614889.</mixed-citation><mixed-citation xml:lang="en">Aranovskiy S., Bobtsov A., Ortega R., Pyrkin A. IEEE Transactions on Automatic Control, 2017, no. 7(62), pp. 3546–3550, DOI: 10.1109/TAC.2016.2614889.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Ortega R., Aranovskiy S., Pyrkin A., Astolfi A., Bobtsov A. New results on parameter estimation via dynamic regressor extension and mixing: Continuous and discrete-time cases // IEEE Transactions on Automatic Control. 2019. Vol. 66, N 5. P. 2265–2272.</mixed-citation><mixed-citation xml:lang="en">Ortega R., Aranovskiy S., Pyrkin A., Astolfi A., Bobtsov A. IEEE Transactions on Automatic Control, 2019, no. 5(66), pp. 2265–2272.</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>
