Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Yunier Bello-Cruz"'
Publikováno v:
Computational Optimization and Applications. 84:295-318
Autor:
Yunier Bello-Cruz, Oday Hazaimah
Publikováno v:
Optimization Letters. 17:789-811
Publikováno v:
Optimization Letters. 17:1069-1081
Generalized circumcenters have been recently introduced and employed to speed up classical projection-type methods for solving feasibility problems. In this note, circumcenters are enforced in a new setting; they are proven to provide inward directio
Publikováno v:
Journal of Optimization Theory and Applications. 194:167-190
In the previous paper Bello-Cruz et al. (J Optim Theory Appl 188:378–401, 2021), we showed that the quadratic growth condition plays a key role in obtaining Q-linear convergence of the widely used forward–backward splitting method with Beck–Teb
A new approach to analyzing intrinsic properties of the Josephus function, $J_{_k}$, is presented in this paper. The linear structure between extreme points of $J_{_k}$ is fully revealed, leading to the design of an efficient algorithm for evaluating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a0ef1e4f63d9a73d918a7562be65d4c
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first provide a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82818a5c80d21d7ce76ed024e021760c
http://arxiv.org/abs/2206.06945
http://arxiv.org/abs/2206.06945
Publikováno v:
Journal of Optimization Theory and Applications. 188:378-401
In this paper, we study the complexity of the forward–backward splitting method with Beck–Teboulle’s line search for solving convex optimization problems, where the objective function can be split into the sum of a differentiable function and a
Publikováno v:
Numerical Algorithms. 86:1475-1494
The ancient concept of circumcenter has recently given birth to the Circumcentered-Reflection method (CRM). CRM was first employed to solve best approximation problems involving affine subspaces. In this setting, it was shown to outperform the most p
Publikováno v:
Optimization. 71:33-53
In this paper, a proximal gradient splitting method for solving nondifferentiable vector optimization problems is proposed. The convergence analysis is carried out when the objective function is th...
This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of the circum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d84c4f76eed23c1b2e78728061dfba4b