Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions

Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint

Type: Preprint

Publication Date: 2020-01-01

Citations: 4

DOI: https://doi.org/10.48550/arxiv.2001.10802

View Publication

Locations

arXiv (Cornell University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions.	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	The evaluation complexity of finding high-order minimizers of nonconvex optimization	2023	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+ PDF Chat	Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints	2018	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints	2018	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity	2019	Serge Gratton Ehouarn Simon Philippe L. Toint
+ PDF Chat	An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity	2020	S. Gratton Ehouarn Simon Philippe L. Toint
+ PDF Chat	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	First-order Methods for Affinely Constrained Composite Non-convex Non-smooth Problems: Lower Complexity Bound and Near-optimal Methods	2023	Wei Liu Qihang Lin Yangyang Xu
+	An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization	2023	Ruyu Liu Shaohua Pan Yitian Qian
+ PDF Chat	Adaptive Third-Order Methods for Composite Convex Optimization	2023	Geovani Nunes Grapiglia Yu. Nesterov
+ PDF Chat	WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION	2019	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Proximal gradient methods with inexact oracle of degree q for composite optimization	2024	Yassine Nabou François Glineur Ion Necoara
+	Strong Evaluation Complexity of An Inexact Trust-Region Algorithm for Arbitrary-Order Unconstrained Nonconvex Optimization	2020	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization	2018	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint
+	Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization	2017	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint
+	High-Order Optimization Methods for Fully Composite Problems	2022	Nikita Doikov Yurii Nesterov
+ PDF Chat	Proximal gradient methods with inexact oracle of degree q for composite optimization	2024	Yassine Nabou François Glineur Ion Necoara

Works That Cite This (4)

Action	Title	Year	Authors
+	Majorization-Minimization-Based Levenberg--Marquardt Method for Constrained Nonlinear Least Squares	2020	Naoki Marumo Takayuki Okuno Akiko Takeda
+ PDF Chat	Tensor methods for finding approximate stationary points of convex functions	2020	Geovani Nunes Grapiglia Yurii Nesterov
+ PDF Chat	OFFO minimization algorithms for second-order optimality and their complexity	2022	S. Gratton Philippe L. Toint
+ PDF Chat	Quadratic and Cubic Regularisation Methods with Inexact function and Random Derivatives for Finite-Sum Minimisation	2021	Stefania Bellavia Gianmarco Gurioli Benedetta Morini Philippe L. Toint

Works Cited by This (0)

Action	Title	Year	Authors