Zobrazeno 1 - 10
of 50
pro vyhledávání: '"E.A. Nurminski"'
Autor:
A.V. Zatserkovnyy, E.A. Nurminski
Publikováno v:
Informatika i sistemy upravleniya. :93-105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0f81f5d83b3758506e24f52d43809c8
https://doi.org/10.22250/18142400_2022_73_3_93
https://doi.org/10.22250/18142400_2022_73_3_93
Autor:
E.A. Nurminski, Natalia B. Shamray
Publikováno v:
Optimization and Applications ISBN: 9783030910587
OPTIMA
OPTIMA
The single-projection linear optimization method (Nurminski, E.A.: Single-projection procedure for linear optimization. Journal of Global Optimization. 66(1), 95–110 (2016)) demonstrated a promising computational performance on the series of giga-s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57ac42fc0a474d4cdb0ab2bd780452a4
https://doi.org/10.1007/978-3-030-91059-4_4
https://doi.org/10.1007/978-3-030-91059-4_4
Autor:
E.A. Nurminski, Natalia B. Shamray
Publikováno v:
Communications in Computer and Information Science ISBN: 9783030386023
This paper considers implementable versions of a conceptual convex optimization algorithm which provides a high-speed (super-linear, quadratic and finite) convergence for broad classes of convex optimization problems. The algorithm can be best viewed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f552faba54450e859f0c9a46643cbead
https://doi.org/10.1007/978-3-030-38603-0_32
https://doi.org/10.1007/978-3-030-38603-0_32
Autor:
E.A. Nurminski
Publikováno v:
Optimization Letters. 13:23-34
This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated projection on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00f1fbbbc2806d8710d838dc5c2cdd88
https://doi.org/10.1007/s11590-018-1269-3
https://doi.org/10.1007/s11590-018-1269-3
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Numerical Nonsmooth Optimization ISBN: 9783030349097
This chapter is devoted to the black-box subgradient algorithms with the minimal requirements for the storage of auxiliary results, which are necessary to execute these algorithms. It starts with the original result of N.Z. Shor which open this field
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cfc4565e02e16480fa07c98f42ac1e80
http://arxiv.org/abs/1902.01572
http://arxiv.org/abs/1902.01572
Autor:
E.A. Nurminski, Natalia B. Shamray
Publikováno v:
Mathematical Optimization Theory and Operations Research ISBN: 9783030333935
MOTOR (2)
MOTOR (2)
We present here the set of conditions for recursive optimization-like processes which guarantee their convergence to a given solution set. These conditions simplify convergence studies for such processes by essentially reducing them to the analysis o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::220fc1784335e7786bbd313a62221eca
https://doi.org/10.1007/978-3-030-33394-2_23
https://doi.org/10.1007/978-3-030-33394-2_23
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Informatika i sistemy upravleniya. :14-25
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6591e56d36550427d27b3eb0ab949660
https://doi.org/10.22250/isu.2016.47.14-25
https://doi.org/10.22250/isu.2016.47.14-25
Autor:
E.A. Nurminski
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319694030
LION
LION
First, this paper introduces a notion of a sharp penalty mapping which can replace more common exact penalty function for convex feasibility problems. Second, it uses it for solution of variational inequalities with monotone operators or pseudo-varit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::280caf360521893ef678410e51b79ae9
https://doi.org/10.1007/978-3-319-69404-7_15
https://doi.org/10.1007/978-3-319-69404-7_15