default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Yunier Bello Cruz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Roger Behling
, Yunier Bello-Cruz, Alfredo N. Iusem, Di Liu, Luiz-Rafael Santos:
A successive centralized circumcentered-reflection method for the convex feasibility problem. Comput. Optim. Appl. 87(1): 83-116 (2024)- [j28]Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem, Luiz-Rafael Santos:
On the centralization of the circumcentered-reflection method. Math. Program. 205(1): 337-371 (2024) - [j27]Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem, Di Liu, Luiz-Rafael Santos:
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem. SIAM J. Optim. 34(3): 2535-2556 (2024) - 2023
- [j26]José Yunier Bello Cruz, Max L. N. Gonçalves, Nathan Krislock:
On FISTA with a relative error rule. Comput. Optim. Appl. 84(2): 295-318 (2023) - [j25]José Yunier Bello Cruz, Oday Hazaimah:
On the weak and strong convergence of modified forward-backward-half-forward splitting methods. Optim. Lett. 17(3): 789-811 (2023) - [j24]Roger Behling, Yunier Bello-Cruz, Hugo Lara-Urdaneta, Harry Oviedo, Luiz-Rafael Santos:
Circumcentric directions of cones. Optim. Lett. 17(4): 1069-1081 (2023) - [i1]Yunier Bello-Cruz, Roy Quintero-Contreras:
Analytical Study and Efficient Evaluation of the Josephus Function. CoRR abs/2303.15457 (2023) - 2022
- [j23]José Yunier Bello Cruz, Guoyin Li, Tran T. A. Nghia:
Quadratic Growth Conditions and Uniqueness of Optimal Solution to Lasso. J. Optim. Theory Appl. 194(1): 167-190 (2022) - 2021
- [j22]Reza Arefidamghani, Roger Behling, José Yunier Bello Cruz, Alfredo N. Iusem, Luiz-Rafael Santos:
The circumcentered-reflection method achieves better rates than alternating projections. Comput. Optim. Appl. 79(2): 507-530 (2021) - [j21]José Yunier Bello Cruz, Guoyin Li, Tran T. A. Nghia:
On the Linear Convergence of Forward-Backward Splitting Method: Part I - Convergence Analysis. J. Optim. Theory Appl. 188(2): 378-401 (2021) - [j20]Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
On the circumcentered-reflection method for the convex feasibility problem. Numer. Algorithms 86(4): 1475-1494 (2021) - [j19]Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections. SIAM J. Optim. 31(4): 2863-2892 (2021) - 2020
- [j18]Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
The block-wise circumcentered-reflection method. Comput. Optim. Appl. 76(3): 675-699 (2020)
2010 – 2019
- 2018
- [j17]Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
Circumcentering the Douglas-Rachford method. Numer. Algorithms 78(3): 759-776 (2018) - [j16]Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
On the linear convergence of the circumcentered-reflection method. Oper. Res. Lett. 46(2): 159-162 (2018) - 2016
- [j15]José Yunier Bello Cruz, Orizon Pereira Ferreira, Leandro da Fonseca Prudente:
On the global convergence of the inexact semi-smooth Newton method for absolute value equation. Comput. Optim. Appl. 65(1): 93-108 (2016) - [j14]J. G. Barrios, José Yunier Bello Cruz, Orizon P. Ferreira, Sándor Zoltán Németh:
A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming. J. Comput. Appl. Math. 301: 91-100 (2016) - [j13]José Yunier Bello Cruz, R. Díaz Millán:
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces. J. Glob. Optim. 65(3): 597-614 (2016) - [j12]Heinz H. Bauschke, José Yunier Bello Cruz, Tran T. A. Nghia, Hung M. Phan, Xianfu Wang:
Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces. Numer. Algorithms 73(1): 33-76 (2016) - [j11]José Yunier Bello Cruz, Tran T. A. Nghia:
On the convergence of the forward-backward splitting method with linesearches. Optim. Methods Softw. 31(6): 1209-1238 (2016) - 2015
- [j10]José Yunier Bello Cruz, Alfredo N. Iusem:
Full convergence of an approximate projection method for nonsmooth variational inequalities. Math. Comput. Simul. 114: 2-13 (2015) - 2014
- [j9]José Yunier Bello Cruz, Gemayqzel Bouza Allende, L. R. Lucambio Pérez:
Subgradient algorithms for solving variable inequalities. Appl. Math. Comput. 247: 1052-1063 (2014) - [j8]Heinz H. Bauschke, José Yunier Bello Cruz, Tran T. A. Nghia, Hung M. Phan, Xianfu Wang:
The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J. Approx. Theory 185: 63-79 (2014) - [j7]José Yunier Bello Cruz, Welington de Oliveira:
Level bundle-like algorithms for convex optimization. J. Glob. Optim. 59(4): 787-809 (2014) - [j6]José Yunier Bello Cruz, R. Díaz Millán:
A Direct Splitting Method for Nonsmooth Variational Inequalities. J. Optim. Theory Appl. 161(3): 728-737 (2014) - [j5]José Yunier Bello Cruz, Gemayqzel Bouza Allende:
A Steepest Descent-Like Method for Variable Order Vector Optimization Problems. J. Optim. Theory Appl. 162(2): 371-391 (2014) - [j4]José Yunier Bello Cruz, L. R. Lucambio Pérez:
A Subgradient-Like Algorithm for Solving Vector Convex Inequalities. J. Optim. Theory Appl. 162(2): 392-404 (2014) - 2013
- [j3]José Yunier Bello Cruz, Paulo Sérgio Marques dos Santos, Susana Scheimberg:
A Two-Phase Algorithm for a Variational Inequality Formulation of Equilibrium Problems. J. Optim. Theory Appl. 159(3): 562-575 (2013) - [j2]José Yunier Bello Cruz:
A Subgradient Method for Vector Optimization Problems. SIAM J. Optim. 23(4): 2169-2182 (2013) - 2010
- [j1]José Yunier Bello Cruz, Alfredo N. Iusem:
Convergence of direct methods for paramonotone variational inequalities. Comput. Optim. Appl. 46(2): 247-263 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
