| Publication | Date of Publication | Type |
|---|
Convergent least-squares optimization methods for variational data assimilation
Optimization | 2024-11-04 | Paper |
The evaluation complexity of finding high-order minimizers of nonconvex optimization
International Congress of Mathematicians | 2024-03-22 | Paper |
Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods
| 2023-12-15 | Paper |
Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
| 2023-08-29 | Paper |
Global optimization using random embeddings
Mathematical Programming. Series A. Series B | 2023-06-23 | Paper |
Scalable subspace methods for derivative-free nonlinear least-squares optimization
Mathematical Programming. Series A. Series B | 2023-05-02 | Paper |
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
Nonlinear matrix recovery using optimization on the Grassmann manifold
Applied and Computational Harmonic Analysis | 2022-12-08 | Paper |
Randomised subspace methods for non-convex optimization, with applications to nonlinear least-squares
| 2022-11-17 | Paper |
Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
| 2022-09-02 | Paper |
Escaping local minima with local derivative-free methods: a numerical investigation
Optimization | 2022-08-01 | Paper |
A dimensionality reduction technique for unconstrained global optimization of functions with low effective dimensionality
Information and Inference: A Journal of the IMA | 2022-05-04 | Paper |
Nonlinear matrix recovery using optimization on the Grassmann manifold
| 2021-09-13 | Paper |
Convergent least-squares optimisation methods for variational data assimilation
| 2021-07-26 | Paper |
Adaptive regularization with cubics on manifolds
Mathematical Programming. Series A. Series B | 2021-07-02 | Paper |
Erratum to: ``Global rates of convergence for nonconvex optimization on manifolds
IMA Journal of Numerical Analysis | 2021-03-31 | Paper |
Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization
| 2020-11-02 | Paper |
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Proceedings of the International Congress of Mathematicians (ICM 2018) | 2020-09-22 | Paper |
Constrained global optimization of functions with low effective dimensionality using multiple random embeddings
| 2020-09-22 | Paper |
On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces
BIT | 2020-08-17 | Paper |
Global rates of convergence for nonconvex optimization on manifolds
IMA Journal of Numerical Analysis | 2020-06-04 | Paper |
Improving the flexibility and robustness of model-based derivative-free optimization solvers
ACM Transactions on Mathematical Software | 2020-04-24 | Paper |
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
SIAM Journal on Optimization | 2020-02-25 | Paper |
A derivative-free Gauss-Newton method
Mathematical Programming Computation | 2020-02-17 | Paper |
Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions
| 2020-01-29 | Paper |
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
| 2019-11-20 | Paper |
Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
SIAM Journal on Optimization | 2019-03-22 | Paper |
Escaping local minima with derivative-free methods: a numerical investigation
| 2018-12-29 | Paper |
Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization
Foundations of Computational Mathematics | 2018-09-27 | Paper |
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
Mathematical Programming. Series A. Series B | 2018-06-25 | Paper |
Quantitative Recovery Conditions for Tree-Based Compressed Sensing
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Convergence Rate Analysis of a Stochastic Trust Region Method via Submartingales
| 2016-09-23 | Paper |
Active-set prediction for interior point methods using controlled perturbations
Computational Optimization and Applications | 2016-04-04 | Paper |
Obituary for Mike Powell
Optimization Methods \& Software | 2015-09-04 | Paper |
On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
SIAM Journal on Numerical Analysis | 2015-05-27 | Paper |
Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Optimization | 2015-04-28 | Paper |
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
Journal of Global Optimization | 2015-03-24 | Paper |
On the complexity of finding first-order critical points in constrained nonlinear optimization
Mathematical Programming. Series A. Series B | 2014-06-02 | Paper |
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
SIAM Journal on Optimization | 2013-12-13 | Paper |
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
Optimization Methods \& Software | 2013-06-24 | Paper |
An exact tree projection algorithm for wavelets
| 2013-04-16 | Paper |
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
SIAM Journal on Optimization | 2012-08-22 | Paper |
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Optimization Methods \& Software | 2012-05-23 | Paper |
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
SIAM Journal on Optimization | 2012-03-16 | Paper |
Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
Mathematical Programming. Series A. Series B | 2011-12-14 | Paper |
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
Mathematical Programming. Series A. Series B | 2011-05-11 | Paper |
Compressed sensing: how sharp is the restricted isometry property?
SIAM Review | 2011-03-25 | Paper |
Phase transitions for greedy sparse approximation algorithms
Applied and Computational Harmonic Analysis | 2011-03-09 | Paper |
Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
Applied Numerical Mathematics | 2009-04-15 | Paper |
Learning the subspace of variation for global optimization of functions with low effective dimension
| N/A | Paper |
Global Convergence of High-Order Regularization Methods with Sums-of-Squares Taylor Models
| N/A | Paper |
