Zobrazeno 1 - 10
of 54
pro vyhledávání: '"Sorin-Mihai Grad"'
Autor:
Sorin-Mihai Grad
Publikováno v:
Algorithms, Vol 17, Iss 8, p 349 (2024)
In recent years, nonsmooth optimization and analysis have seen remarkable advancements, significantly impacting various scientific and engineering disciplines [...]
Externí odkaz:
https://doaj.org/article/7e7bd0cd8692417eb704be4e174a03b3
Autor:
Sorin-Mihai Grad
Publikováno v:
Frontiers in Applied Mathematics and Statistics, Vol 2 (2016)
The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this
Externí odkaz:
https://doaj.org/article/104e78c83f2d432593bcb52855d9da98
Publikováno v:
Advances in Nonlinear Analysis, Vol 10, Iss 1, Pp 450-476 (2020)
Advances in Nonlinear Analysis
Advances in Nonlinear Analysis, De Gruyter, 2021, 10 (1), pp.450-476. ⟨10.1515/anona-2020-0143⟩
Advances in Nonlinear Analysis, 10(1), 450-476. De Gruyter
Advances in Nonlinear Analysis
Advances in Nonlinear Analysis, De Gruyter, 2021, 10 (1), pp.450-476. ⟨10.1515/anona-2020-0143⟩
Advances in Nonlinear Analysis, 10(1), 450-476. De Gruyter
In this work we investigate dynamical systems designed to approach the solution sets of inclusion problems involving the sum of two maximally monotone operators. Our aim is to design methods which guarantee strong convergence of trajectories towards
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f826ec1795a6b7397d427eeab53203b8
https://doaj.org/article/956c2fa00fca4524a8984672ca1a0b3c
https://doaj.org/article/956c2fa00fca4524a8984672ca1a0b3c
Publikováno v:
Optimization
Optimization, Taylor & Francis, 2021, 70 (9), pp.1837-1858. ⟨10.1080/02331934.2020.1756287⟩
article-version (VoR) Version of Record
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Optimization, Taylor & Francis, 2021, 70 (9), pp.1837-1858. ⟨10.1080/02331934.2020.1756287⟩
article-version (VoR) Version of Record
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
We present new results on optimization problems where the involved functions are evenly convex. By means of a generalized conjugation scheme and the perturbation theory introduced by Rockafellar, we propose an alternative dual problem for a general o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12c2263538119619d541db31d8476fa6
https://hal.archives-ouvertes.fr/hal-03429963
https://hal.archives-ouvertes.fr/hal-03429963
Autor:
Felipe Lara, Sorin-Mihai Grad
Publikováno v:
Journal of Optimization Theory and Applications
Journal of Optimization Theory and Applications, Springer Verlag, 2021, 190 (2), pp.565-580. ⟨10.1007/s10957-021-01860-9⟩
Journal of Optimization Theory and Applications, Springer Verlag, 2021, 190 (2), pp.565-580. ⟨10.1007/s10957-021-01860-9⟩
We show that Malitsky’s recent Golden Ratio Algorithm for solving convex mixed variational inequalities can be employed in a certain nonconvex framework as well, making it probably the first iterative method in the literature for solving generalize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c47114b2e652d3227c6390bfed8023b
https://hal.archives-ouvertes.fr/hal-03429961
https://hal.archives-ouvertes.fr/hal-03429961
Autor:
Sorin-Mihai Grad, Felipe Lara
Publikováno v:
Journal of Global Optimization
Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-01081-4⟩
Journal of Global Optimization, Springer Verlag, 2021, ⟨10.1007/s10898-021-01081-4⟩
We introduce and investigate a new generalized convexity notion for functions called prox-convexity. The proximity operator of such a function is single-valued and firmly nonexpansive. We provide examples of (strongly) quasiconvex, weakly convex, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::61a8086a0ec87b2b04c0181b2468f6e9
http://arxiv.org/abs/2104.08822
http://arxiv.org/abs/2104.08822
Autor:
Sorin-Mihai Grad, Radu Ioan Boţ
Publikováno v:
Optimization
We propose two forward–backward proximal point type algorithms with inertial/memory effects for determining weakly efficient solutions to a vector optimization problem consisting in vector-minimizing with respect to a given closed convex pointed co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5de8709208810aef41e6eda502294fb6
http://europepmc.org/articles/PMC6030681
http://europepmc.org/articles/PMC6030681
Autor:
Sorin-Mihai Grad
Publikováno v:
Optimization Letters. 12:915-922
In this note we provide sufficient conditions that guarantee representations via linear scalarization of different types of properly minimal elements of a given set by means of a new separation statement for closed convex cones. Moreover, we also giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51cc45a0c7231eeaf7aaef6e5cec8e06
https://doi.org/10.1007/s11590-017-1164-3
https://doi.org/10.1007/s11590-017-1164-3
Autor:
Sorin-Mihai Grad, Regina Burachik
This book brings together research articles and state-of-the-art surveys in broad areas of optimization and numerical analysis with particular emphasis on algorithms. The discussion also focuses on advances in monotone operator theory and other topic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1414b001bb814f81329ce6dc61644c8
https://doi.org/10.1007/978-3-030-25939-6
https://doi.org/10.1007/978-3-030-25939-6
Autor:
Sorin-Mihai Grad
Publikováno v:
Splitting Algorithms, Modern Operator Theory, and Applications ISBN: 9783030259389
In this survey paper we present the existing generalizations of the proximal point method from scalar to vector optimization problems, discussing some of their advantages and drawbacks, respectively, presenting some open challenges and sketching some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afa263397da5288da0d40e94645c9ef8
https://doi.org/10.1007/978-3-030-25939-6_11
https://doi.org/10.1007/978-3-030-25939-6_11