Geovani Nunes Grapiglia

From MaRDI portal
(Redirected from Geovani Nunes Grapiglia)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Enhancing finite-difference-based derivative-free optimization with machine learning
Optimization Letters
2026-09-15Paper
A non-monotone line-search method for minimizing functions with spurious local minima
Operations Research Letters
2026-04-24Paper
Complexity of quadratic penalty methods with adaptive accuracy under a PL condition for the constraints
(available as arXiv preprint)
2026-01-01Paper
Riemannian optimization with finite-difference gradient approximations
(available as arXiv preprint)
2026-01-01Paper
Fully adaptive zeroth-order method for minimizing functions with compressible gradients
Journal of Optimization Theory and Applications
2025-10-29Paper
TRFD: a derivative-free trust-region method based on finite differences for composite nonsmooth optimization
SIAM Journal on Optimization
2025-08-26Paper
First and zeroth-order implementations of the regularized Newton method with lazy approximated Hessians
Journal of Scientific Computing
2025-04-03Paper
Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
Computational and Applied Mathematics
2025-01-09Paper
Fully Adaptive Zeroth-Order Method for Minimizing Functions with Compressible Gradients
(available as arXiv preprint)
2025-01-01Paper
Enhancing finite-difference based derivative-free optimization methods with machine learning
(available as arXiv preprint)
2025-01-01Paper
A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima
(available as arXiv preprint)
2025-01-01Paper
Sub-sampled Trust-Region Methods with Deterministic Worst-Case Complexity Guarantees
(available as arXiv preprint)
2025-01-01Paper
Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
(available as arXiv preprint)
2025-01-01Paper
A Riemannian AdaGrad-Norm Method
(available as arXiv preprint)
2025-01-01Paper
On the Complexity of Lower-Order Implementations of Higher-Order Methods
(available as arXiv preprint)
2025-01-01Paper
A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization
(available as arXiv preprint)
2025-01-01Paper
Worst-case evaluation complexity of a derivative-free quadratic regularization method
Optimization Letters
2024-01-22Paper
TRFD: A derivative-free trust-region method based on finite differences for composite nonsmooth optimization
(available as arXiv preprint)
2024-01-01Paper
Adaptive Third-Order Methods for Composite Convex Optimization
SIAM Journal on Optimization
2023-08-11Paper
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
Optimization Methods & Software
2023-08-09Paper
Quadratic regularization methods with finite-difference gradient approximations
Computational Optimization and Applications
2023-07-24Paper
An adaptive Riemannian gradient method without function evaluations
Journal of Optimization Theory and Applications
2023-07-07Paper
A subgradient method with non-monotone line search
Computational Optimization and Applications
2023-04-17Paper
Tensor methods for finding approximate stationary points of convex functions
Optimization Methods & Software
2022-09-30Paper
On the complexity of an augmented Lagrangian method for nonconvex optimization
IMA Journal of Numerical Analysis
2022-05-17Paper
A subgradient method with non-monotone line search
(available as arXiv preprint)
2022-04-21Paper
An adaptive trust-region method without function evaluations
Computational Optimization and Applications
2022-04-12Paper
Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
Computational and Applied Mathematics
2021-11-25Paper
A generalized worst-case complexity analysis for non-monotone line searches
Numerical Algorithms
2021-05-31Paper
On inexact solution of auxiliary problems in tensor methods for convex optimization
Optimization Methods & Software
2021-04-15Paper
A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization
Applied Mathematics and Computation
2021-03-29Paper
Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
SIAM Journal on Optimization
2020-10-08Paper
Tensor Methods for Finding Approximate Stationary Points of Convex Functions
(available as arXiv preprint)
2019-07-13Paper
On the Complexity of an Augmented Lagrangian Method for Nonconvex Optimization
(available as arXiv preprint)
2019-06-13Paper
Improved optimization methods for image registration problems
Numerical Algorithms
2019-02-07Paper
Accelerated regularized Newton methods for minimizing composite convex functions
SIAM Journal on Optimization
2019-01-14Paper
On the worst-case evaluation complexity of non-monotone line search algorithms
Computational Optimization and Applications
2018-02-01Paper
A derivative-free trust-region algorithm for composite nonsmooth optimization
Computational and Applied Mathematics
2017-08-08Paper
Regularized Newton methods for minimizing functions with Hölder continuous hessians
SIAM Journal on Optimization
2017-05-30Paper
Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
Journal of Optimization Theory and Applications
2017-01-17Paper
On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
Optimization Methods & Software
2016-06-29Paper
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
Mathematical Programming. Series A. Series B
2015-08-31Paper
A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
Journal of the Operations Research Society of China
2014-09-30Paper


Research outcomes over time


This page was built for person: Geovani Nunes Grapiglia