Bello-Cruz Homepage

Yunier Bello-Cruz

"What we think, we become"

(Buddha) 

https://sites.google.com/site/joseyunierbellocruz

Last Updated by February 2024

MathSciNet   SCOPUS   Google Scholar    ResearchGate    Web of Science   zbMATH  ORCiD  FULL-CV 

Name Used in  Bibliographic Citations: J.Y. Bello Cruz & J.Y.B. Cruz & J.Y. Bello-Cruz & Yunier Bello-Cruz

Welcome to my Webpage. I am an Associate Professor: Numerical Analysis and Optimization and the AIC Director of the Ph.D. Program in the Department of Mathematical Sciences at Northern Illinois University (NIU), IL, USA. Prior to NIU, I was an Assistant Professor (with tenure) at the Institute of Mathematics and Statistics at the Federal University of Goias, BRAZIL. I worked for almost two years with Prof. Heinz H. Bauschke as a CNPq Postdoctoral Research Fellow in the Irving K. Barber School of Arts and Sciences, Mathematics at the University of British Columbia, CANADA. My Ph.D. in Mathematics was supervised by Prof. Alfredo N. Iusem at the Institute of Pure and Applied Mathematics (IMPA), Rio de Janeiro, BRAZIL. All my basic education, the five years Bachelor of Mathematics and the two years M.Sc. in Analysis, were coursed in the Faculty of Mathematics and Computer Science, University of Havana, CUBA.

My main research interest is in the area of Continuous Optimization, focusing on Nonsmooth and Convex Optimization, Variational Inequalities, Inclusion Problems, Algorithms, and Applications. I am interested in the design, complexity, and analysis of efficient algorithms for solving structured optimization problems arising in applications. My research is currently supported by the National Science Foundation (NSF) grant # DMS - 2307328 (2023 to 2026) and by the Research & Artistry Grant (R&A) and CLAS Summer Grant (2023) from NIU. I was awarded several research grants including: an NSF grant # DMS - 1816449 (2018 to 2021), USA, a UNIVERSAL CNPq grant, and a Productivity Research grant by CNPq # 303492/2013-9 (2013 to 2016), Brazil. For further details, please see my CV.

Professional Address:  Watson Hall 330, Department of Mathematical Sciences, Northern Illinois University. DeKalb, IL - 60115, USA. 

Phones: +1 8157536764 (Office Number) or  8159818002 (Online Number) 


Email: yunierbello at niu dot edu  or  yunier.bello at gmail dot com 

EXPERIENCE

EDUCATION

RESEARCH PROJECTS AND GRANTS, SCHOLARSHIPS AND AWARDS

PREPRINTS AND PUBLICATIONS IN REFEREED JOURNALS 

2024(6) - 2023(6) - 2022(4) - 2021(4) - 2020(1) - 2019(1) - 2018(2) - 2017(3) - 2016(7) - 2015(2) - 2014(6) - 2013(2) - 2012(1) - 2011(3) - 2010(3) - 2009(1)

Research Interests: Calculus of variations and optimal control; Optimization; Fourier analysis; Operations research; Mathematical programming; Operator theory

GRADUATE STUDENTS AND SUPERVISIONS



Co-authors and Collaborators from MathSciNet and Scopus

Ackooij, W.V. & Araujo, G. & Arefidamghani, R. & Armijo, N. & Barrios, J.G. & Bauschke, H.H. & Behling, R. & Bouza Allende, G. & de Oliveira, W. & Díaz Millán, R. & Ferreira, O.P. & Gonçalves, M.L.N. & Haeser, G. & Iusem, A.N. & Krislock, N. & Li, G. & Lucambio Pérez, L.R. & Márquez, C. & Melo, J.G. & Nemeth, S.Z. & Nghia, T.T.A & Pang, H.M. & Pijeira-Cabrera, H. & Prudente, L.F. & Scheimberg, S. & Santos, L.R. & Santos, P.S.M. & Shehu, Y. & Urbina, W.O. & Wang, X. 


SCIENTIFIC MEETINGS AND TALKS  


 - On the Circumcented-Reflection Method

 - Circumcentering Based Projection-Reflection Methods

 - Circumcentering Mathematical Ideas

     - On the Finite Convergence of the Alternating Projections

     - On the Circumcentered-Reflection Method for Solving Convex Feasibility Problems

 - On the Circumcentered-Reflection Method

     - Infeasibility and error bound Imply finite convergence of alternating projections

     - On the finite convergence of alternating projections

     - Finite convergence of alternating projections under infeasibility and an error bound condition

     - A semi-smooth Newton Method for Projection Equations

        - Circumcentering Reflections

        - A semi-smooth Newton Method for Projection Equations and Linear Complementarity Problems

         - On the Q-linear Convergence of the Forward-backward Splitting Method and Uniqueness of Optimal solution to LASSO

         - Circumcentering the Douglas-Rachford Method

  - On proximal (sub)gradient splitting method for nonsmooth convex optimization problems

 - A relaxed Algorithm for solving nonsmooth variational inequalities

 - On the complexity of the Proximal Gradient Iteration for Nonsmooth Convex Minimization Problems in Hilbert Spaces

       - On the complexity of the proximal gradient method for nonsmooth convex minimization problems

 - Conditional Extragradient Algorithm for Variational Inequalities

        - On Proximal Forward-Backward Splitting Method for Convex Optimization Problems

        - On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions

         - On the convergence of the proximal forward-backward splitting method with linesearches

           - On Proximal Forward-Backward Splitting Method for Convex Optimization Problems

  - Conditional Extragradient Algorithms for Variational Inequalities

               - On Proximal Forward-Backward Splitting Method for Nonsmooth Optimization Problems

               - A Relaxed Projection Splitting Algorithm for Nonsmooth Variational Inequalities in Hilbert Spaces

                - A Relaxed-Projection Splitting Algorithm for Variational Inequalities in Hilbert Spaces

               - On Forward-Backward Splitting Methods

               - Subgradient algorithms for vector optimization problems.

                - A subgradient method for vector optimization problems.

                - A strongly convergent method for nonsmooth convex minimization in Hilbert spaces.

                - A modified extragradient method for variational inequalities in Hilbert spaces.

                - A strongly convergent direct method for monotone variational inequalities in Hilbert spaces.

                - An explicit method for monotone variational inequalities

                 - Forcing strong convergence of Korpelevich-type algorithm in Hilbert spaces.

               - Primitives of Classical Orthogonal Polynomial 

                 - On Polar Legendre Polynomials


MathSciNet   SCOPUS   Google Scholar    ResearchGate    Web of Science   zbMATH  ORCiD  FULL-CV 



"There is no substitute for hard work"

"Genius is an infinite capacity for taking pains"

"I have not failed. I've just found 10,000 ways that won't work"

"Genius is one percent inspiration and ninety-nine percent perspiration"

"Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time"

(Thomas Edison)  

 "Curiosity has its own reason for existing" 

(Albert Einstein) 

 "Excellence is not an act but a habit" 

(Aristotle)