Pages that link to "Item:Q5217594"

The following pages link to Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints (Q5217594):

Displaying 18 items.

• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598) (← links)
• High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
• Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← links)
• An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
• The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
• A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
• Derivative-free optimization methods (Q5230522) (← links)
• A nonlinear conjugate gradient method using inexact first-order information (Q6051169) (← links)
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound (Q6116246) (← links)
• Super-Universal Regularized Newton Method (Q6136654) (← links)
• Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques (Q6170037) (← links)
• Approximating Higher-Order Derivative Tensors Using Secant Updates (Q6195316) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)
• Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization (Q6579994) (← links)
• Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
• Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)