Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2023, Volume 29, Number 3, Pages 168–184
DOI: https://doi.org/10.21538/0134-4889-2023-29-3-168-184
(Mi timm2025)
 

On the optimal correction of improper convex programming problems based on the method of quasi-solutions

V. D. Skarin

N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
References:
Abstract: The work continues the author's research on the construction of possible approximations for improper problems of convex programming. The problem of minimizing the objective function of the original problem on the set of minimum points of the Chebyshev norm of the constraint discrepancy is defined as a basic model for correcting an improper problem. For this setting, one of the classical methods of regularization of ill-posed extremal problems is used, namely, the method of quasi-solutions. This method is based on the transition to a problem of unconstrained minimization by aggregation of the constraint function of the original problem. For this purpose, a modification of the penalty function method is used, namely, the generalized inverse barrier function method. This approach seems to be promising from the point of view of the numerical implementation of the quasi-solution method. Convergence conditions are formulated for the proposed method, including the case where the input data are given inaccurately. Special attention is paid to finding the value of optimal correction of the constraints in the improper problem of convex programming under study and to calculating the optimal value of the regularization parameter in the method of quasi-solutions.
Keywords: convex programming, improper problem, optimal correction, method of quasi-solutions, barrier function methods.
Funding agency Grant number
Ministry of Science and Higher Education of the Russian Federation 075-02-2023-913
This study is a part of the research carried out at the Ural Mathematical Center and supported by the Ministry of Science and Higher Education of the Russian Federation (agreement no. 075-02-2023-913).
Received: 27.03.2023
Revised: 14.07.2023
Accepted: 21.07.2023
Bibliographic databases:
Document Type: Article
UDC: 519.853
MSC: 47N05, 37N25, 37N40
Language: Russian
Citation: V. D. Skarin, “On the optimal correction of improper convex programming problems based on the method of quasi-solutions”, Trudy Inst. Mat. i Mekh. UrO RAN, 29, no. 3, 2023, 168–184
Citation in format AMSBIB
\Bibitem{Ska23}
\by V.~D.~Skarin
\paper On the optimal correction of improper convex programming problems based on the method of quasi-solutions
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2023
\vol 29
\issue 3
\pages 168--184
\mathnet{http://mi.mathnet.ru/timm2025}
\crossref{https://doi.org/10.21538/0134-4889-2023-29-3-168-184}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4649599}
\elib{https://elibrary.ru/item.asp?id=54393174}
\edn{https://elibrary.ru/eorqdo}
Linking options:
  • https://www.mathnet.ru/eng/timm2025
  • https://www.mathnet.ru/eng/timm/v29/i3/p168
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Trudy Instituta Matematiki i Mekhaniki UrO RAN
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024