default search action
Harry Oviedo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j14]Jean-Paul Chehab, Harry Oviedo, Marcos Raydan
:
Optimization schemes on manifolds for structured matrices with fixed eigenvalues. Comput. Optim. Appl. 90(1): 1-26 (2025) - 2024
- [j13]Hugo Lara, Rafael Aleixo, Harry Oviedo
Delayed Weighted Gradient Method with simultaneous step-sizes for strongly convex optimization. Comput. Optim. Appl. 89(1): 151-182 (2024) - [j12]Roger Behling, Hugo J. Lara, Harry Oviedo
Computing the completely positive factorization via alternating minimization. Numer. Linear Algebra Appl. 31(2) (2024) - 2023
- [j11]Harry Oviedo
A collection of efficient retractions for the symplectic Stiefel manifold. Comput. Appl. Math. 42(4) (2023) - [j10]Roger Behling
Circumcentric directions of cones. Optim. Lett. 17(4): 1069-1081 (2023) - 2022
- [j9]Roberto Andreani
An extended delayed weighted gradient algorithm for solving strongly convex optimization problems. J. Comput. Appl. Math. 416: 114525 (2022) - [j8]Harry Oviedo
A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization. Numer. Algorithms 90(3): 1225-1252 (2022) - [j7]Harry Oviedo
Global convergence of Riemannian line search methods with a Zhang-Hager-type condition. Numer. Algorithms 91(3): 1183-1203 (2022) - [j6]Harry Oviedo
Implicit steepest descent algorithm for optimization with orthogonality constraints. Optim. Lett. 16(6): 1773-1797 (2022) - 2021
- [j5]Harry Oviedo
Spectral residual method for nonlinear equations on Riemannian manifolds. Comput. Appl. Math. 40(7) (2021) - [j4]Harry Oviedo
Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization. Numer. Algorithms 87(3): 1107-1127 (2021) - [j3]Harry Oviedo
A hybrid gradient method for strictly convex quadratic programming. Numer. Linear Algebra Appl. 28(4) (2021) - 2020
- [i3]Harry F. Oviedo
Scaled Fixed Point Algorithm for Computing the Matrix Square Root. CoRR abs/2002.08471 (2020) - [i2]Harry Oviedo, Hugo Lara:
Spectral Residual Method for Nonlinear Equations on Riemannian Manifolds. CoRR abs/2011.13510 (2020)
2010 – 2019
- 2019
- [j2]Harry Fernando Oviedo Leon
A delayed weighted gradient method for strictly convex quadratic minimization. Comput. Optim. Appl. 74(3): 729-746 (2019) - [j1]Harry Oviedo
A non-monotone linear search algorithm with mixed direction on Stiefel manifold. Optim. Methods Softw. 34(2): 437-457 (2019) - [c2]Harry Oviedo
A Scaled Gradient Projection Method for Minimization over the Stiefel Manifold. MICAI 2019: 239-250 - [i1]Harry F. Oviedo:
A Spectral Gradient Projection Method for the Positive Semi-definite Procrustes Problem. CoRR abs/1908.06497 (2019) - 2017
- [c1]Oscar Dalmau Cedeño, Harry Oviedo
A Projection Method for Optimization Problems on the Stiefel Manifold. MCPR 2017: 84-93
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 2025-02-18 02:12 CET 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: