Harry Fernando Oviedo Leon

ORCID:

não disponível no Lattes


Formação:
  • Fundação Getúlio Vargas

    | Pós-Doutorado | 2021 - Agora
  • Centro de Investigacion en Matematicas

    Doctorado en Ciencias de la Computación | Doutorado | 2017 - 2021
  • Centro de Investigacion en Matematicas

    Maestría en Ciencias de la Computación | Mestrado | 2014 - 2016
  • Universidad Centroccidental Lisandro Alvarado

    Licenciatura en Ciencias Matemáticas | Graduação | 2007 - 2013
Laboratórios:
Nenhum laboratório cadastrado
Nuvens de Palavras:
Artigos:

(95.24% artigos com DOI)

Titulo DOI Ano
Computing the completely positive factorization via alternating minimization 10.1002/nla.2535 2024
Circumcentric directions of cones 10.1007/s11590-022-01923-4 2023
Scaled fixed point algorithm for computing the matrix square root 10.24193/fpt-ro.2023.1.16 2023
A collection of efficient retractions for the symplectic Stiefel manifold 10.1007/s40314-023-02302-0 2023
Proximal Point Algorithm with Euclidean Distance on the Stiefel Manifold 10.3390/math11112414 2023
An extended delayed weighted gradient algorithm for solving strongly convex optimization problems 10.1016/j.cam.2022.114525 2022
Global convergence of Riemannian line search methods with a Zhang-Hager-type condition 10.1007/s11075-022-01298-8 2022
Two Novel Gradient Methods with Optimal Step Sizes 10.4208/jcm.2001-m2018-0205 2021
A Spectral Gradient Projection Method for the Positive Semi-definite Procrustes Problem 10.15446/recolma.v55n1.99100 2021
A second-order gradient method for convex minimization 10.1007/s40590-021-00375-7 2021
A cyclic delayed weighted steplength for the gradient method 10.1007/s11587-021-00646-5 2021
Spectral residual method for nonlinear equations on Riemannian manifolds 10.1007/s40314-021-01630-3 2021
An accelerated minimal gradient method with momentum for strictly convex quadratic optimization 10.1007/s10543-021-00886-9 2021
Implicit steepest descent algorithm for optimization with orthogonality constraints 10.1007/s11590-021-01801-5 2021
A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization 10.1007/s11075-021-01228-0 2021
Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization 10.1007/s11075-020-01001-9 2020
A hybrid gradient method for strictly convex quadratic programming 10.1002/nla.2360 2020
A delayed weighted gradient method for strictly convex quadratic minimization 10.1007/s10589-019-00125-6 2019
Projected nonmonotone search methods for optimization with orthogonality constraints 10.1007/s40314-017-0501-6 2018
A non-monotone linear search algorithm with mixed direction on Stiefel manifold 10.1080/10556788.2017.1415337 2017
Matrix Completion via a low rank factorization model and an Augmented Lagrangean Succesive Overrelaxation Algorithm 2014
Eventos:
Nenhum evento cadastrado
Publicações:
Minha Rede: