Zobrazeno 1 - 8
of 8
pro vyhledávání: '"K. E. Kazaeva"'
Publikováno v:
Учёные записки Казанского университета. Серия Физико-математические науки, Vol 165, Iss 3, Pp 208-218 (2024)
A cutting method for solving the problem of convex programming was proposed. The method calculates iteration points based on approximation by polyhedral sets of the constraint region and the epigraph of the objective function. Its distinguishing feat
Externí odkaz:
https://doaj.org/article/e9d561796fd04a58a60535d0880085b7
Publikováno v:
Lobachevskii Journal of Mathematics. 44:483-490
Autor:
I. Ya. Zabotin, K. E. Kazaeva
Publikováno v:
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki. 161:263-273
Autor:
I. Ya. Zabotin, K. E. Kazaeva
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319937991
We propose a method of solving a convex programming problem, which is based on the ideas of cutting plane methods and the method of penalty functions. To construct each approximation, the method uses an operation of immersing the epigraph of auxiliar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1927016b09bd26c16aded354424d93d8
https://doi.org/10.1007/978-3-319-93800-4_16
https://doi.org/10.1007/978-3-319-93800-4_16
Publikováno v:
Journal of Physics: Conference Series. 1158:042040
Autor:
K. E. Kazaeva, I. Ya. Zabotin
Publikováno v:
Journal of Physics: Conference Series. 1158:042041
Autor:
I. Ya. Zabotin, K. E. Kazaeva
Publikováno v:
IOP Conference Series: Materials Science and Engineering. 158:012097
We propose an algorithm for solving a convex programming problem from the class of cutting methods. The algorithm is characterized by the construction of approximations using some auxiliary functions, instead of the objective function. Each auxiliary
Autor:
I Ya Zabotin, K E Kazaeva
Publikováno v:
Journal of Physics: Conference Series; 2019, Vol. 1158 Issue 4, p1-1, 1p