Related content
Research Output
On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems
Research output: Contribution to journal › Article
Optimal Newton-type methods for nonconvex smooth optimization problems
Research output: Book/Report/Journal › Other report
A concise second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Research output: Contribution to journal › Article
On the complexity of the steepest-descent with exact linesearches
Research output: Book/Report/Journal › Other report
Trust-region and other regularisations of linear least-squares problems
Research output: Contribution to journal › Article
On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
Research output: Contribution to journal › Article
On the complexity of finding first-order critical points in constrained nonlinear optimization
Research output: Contribution to journal › Article
Updating the regularization parameter in the adaptive cubic regularization algorithm
Research output: Contribution to journal › Article
A note about the complexity of minimizing Nesterov's smooth Chebyshev-Rosenbrock function
Research output: Contribution to journal › Article
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Research output: Contribution to journal › Article
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Research output: Working paper
On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods
Research output: Contribution to journal › Article
Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Research output: Working paper
Complexity bounds for second-order optimality in unconstrained optimization
Research output: Contribution to journal › Article
Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
Research output: Contribution in Book/Catalog/Report/Conference proceeding › Chapter
Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Research output: Contribution to journal › Article
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
Research output: Contribution to journal › Article
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
Research output: Working paper
On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
Research output: Contribution to journal › Article
An example of slow convergence for Newton's method on a function with globally Lipschitz continuous Hessian
Research output: Working paper
On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
Research output: Contribution to journal › Article
Second-order optimality and beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization
Research output: Contribution to journal › Article
Complexity of partially separable convexly constrained optimization with non-lipschitzian singularities
Research output: Contribution to journal › Article
Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models
Research output: Contribution to journal › Article
Adaptive cubic regularisation methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity
Research output: Contribution to journal › Article
Optimality of orders one to three and beyond: Characterization and evaluation complexity in constrained nonconvex optimization
Research output: Contribution to journal › Article
High-Order Evaluation Complexity for Convexly-Constrained Optimization with Non-Lipschitzian Group Sparsity Terms
Research output: Working paper
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
Research output: Contribution to journal › Article
Activities
Polytechnic University of Hong Kong
Activity: Visiting an external institution types › Research/Teaching in a external institution
Complexity in nonlinear optimization
Activity: Talk or presentation types › Invited talk
19th Belgian Workshop on Mathematical Programming
Activity: Participating in or organising an event types › Participation in workshop, seminar, course
A path and some adventures in the jungle of high-order nonlinear optimization
Activity: Talk or presentation types › Invited talk
ENSEEIHT-IRIT
Activity: Visiting an external institution types › Visiting an external academic institution
Oxford University
Activity: Visiting an external institution types › Visiting an external academic institution
16th Franco-German-Polish Conference on Optimization
Activity: Participating in or organising an event types › Participation in conference
ENSEEIHT-INP
Activity: Visiting an external institution types › Research/Teaching in a external institution
How much patience do you have? Issues in complexity for nonlinear optimization
Activity: Talk or presentation types › Oral presentation
Università di Firenze
Activity: Visiting an external institution types › Visiting an external academic institution
SIAM Conference on Optimization
Activity: Participating in or organising an event types › Participation in conference
How much patience do you have? Issues in complexity for nonlinear optimization
Activity: Talk or presentation types › Oral presentation
X BRAZOPT, Brazilian Conference on Optimization
Activity: Participating in or organising an event types › Participation in conference
How much patience do you have? Issues in complexity for nonlinear optimization
Activity: Talk or presentation types › Oral presentation
A path and some adventures in the jungle of high-order nonlinear optimization
Activity: Talk or presentation types › Invited talk
Departement of Applied Mathematics, Polytechnic University of Hong Kong
Activity: Visiting an external institution types › Visiting an external academic institution
University of Oxford
Activity: Visiting an external institution types › Research/Teaching in a external institution
Adventures in the jungle of high-degree nonlinear optimization
Activity: Talk or presentation types › Invited talk
Recent Advances in Evaluation Complexity for Nonconvex Optimization
Activity: Talk or presentation types › Invited talk
University of Oxford
Activity: Visiting an external institution types › Research/Teaching in a external institution
How much patience do you have? Issues in complexity for nonlinear optimization
Activity: Talk or presentation types › Oral presentation
Oxford University
Activity: Visiting an external institution types › Research/Teaching in a external institution
Prizes
Honorary Professor
Prize: Honorary degree
Oliver Smithies Fellow
Prize: Fellowship awarded competitively
Leverhulme Fellow
Prize: Fellowship awarded competitively
Projects
ADALGOPT - Advanced algorithms in nonlinear optimization
Project: Research Axis