| Publication | Date of Publication | Type |
|---|
Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
Computational and Applied Mathematics | 2025-01-09 | Paper |
Worst-case evaluation complexity of a derivative-free quadratic regularization method
Optimization Letters | 2024-01-22 | Paper |
Adaptive Third-Order Methods for Composite Convex Optimization
SIAM Journal on Optimization | 2023-08-11 | Paper |
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization
Optimization Methods & Software | 2023-08-09 | Paper |
Quadratic regularization methods with finite-difference gradient approximations
Computational Optimization and Applications | 2023-07-24 | Paper |
An adaptive Riemannian gradient method without function evaluations
Journal of Optimization Theory and Applications | 2023-07-07 | Paper |
A subgradient method with non-monotone line search
Computational Optimization and Applications | 2023-04-17 | Paper |
Tensor methods for finding approximate stationary points of convex functions
Optimization Methods & Software | 2022-09-30 | Paper |
On the complexity of an augmented Lagrangian method for nonconvex optimization
IMA Journal of Numerical Analysis | 2022-05-17 | Paper |
A subgradient method with non-monotone line search
(available as arXiv preprint) | 2022-04-21 | Paper |
An adaptive trust-region method without function evaluations
Computational Optimization and Applications | 2022-04-12 | Paper |
Worst-case evaluation complexity of derivative-free nonmonotone line search methods for solving nonlinear systems of equations
Computational and Applied Mathematics | 2021-11-25 | Paper |
A generalized worst-case complexity analysis for non-monotone line searches
Numerical Algorithms | 2021-05-31 | Paper |
On inexact solution of auxiliary problems in tensor methods for convex optimization
Optimization Methods & Software | 2021-04-15 | Paper |
A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization
Applied Mathematics and Computation | 2021-03-29 | Paper |
Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
SIAM Journal on Optimization | 2020-10-08 | Paper |
Tensor Methods for Finding Approximate Stationary Points of Convex Functions
(available as arXiv preprint) | 2019-07-13 | Paper |
On the Complexity of an Augmented Lagrangian Method for Nonconvex Optimization
(available as arXiv preprint) | 2019-06-13 | Paper |
Improved optimization methods for image registration problems
Numerical Algorithms | 2019-02-07 | Paper |
Accelerated regularized Newton methods for minimizing composite convex functions
SIAM Journal on Optimization | 2019-01-14 | Paper |
On the worst-case evaluation complexity of non-monotone line search algorithms
Computational Optimization and Applications | 2018-02-01 | Paper |
A derivative-free trust-region algorithm for composite nonsmooth optimization
Computational and Applied Mathematics | 2017-08-08 | Paper |
Regularized Newton methods for minimizing functions with Hölder continuous hessians
SIAM Journal on Optimization | 2017-05-30 | Paper |
Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
Journal of Optimization Theory and Applications | 2017-01-17 | Paper |
On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
Optimization Methods & Software | 2016-06-29 | Paper |
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
Mathematical Programming. Series A. Series B | 2015-08-31 | Paper |
A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization
Journal of the Operations Research Society of China | 2014-09-30 | Paper |
