Pages that link to "Item:Q5244400"

The following pages link to Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization (Q5244400):

Displaying 20 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)
• Inexact derivative-free optimization for bilevel learning (Q2036198) (← 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)
• Linesearch Newton-CG methods for convex optimization with noise (Q2084588) (← links)
• Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
• Ritz-like values in steplength selections for stochastic gradient methods (Q2156893) (← links)
• Tensor Bernstein concentration inequalities with an application to sample estimators for high-order moments (Q2178629) (← links)
• Inexact restoration with subsampled trust-region methods for finite-sum minimization (Q2191786) (← links)
• A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
• A regularization method for constrained nonlinear least squares (Q2191800) (← links)
• The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
• Stochastic analysis of an adaptive cubic regularization method under inexact gradient evaluations and dynamic Hessian accuracy (Q5034938) (← links)
• Model-Based Derivative-Free Methods for Convex-Constrained Optimization (Q5043286) (← links)
• A nonlinear conjugate gradient method using inexact first-order information (Q6051169) (← links)
• Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints (Q6076246) (← links)
• Convergence Properties of an Objective-Function-Free Optimization Regularization Algorithm, Including an \(\boldsymbol{\mathcal{O}(\epsilon^{-3/2})}\) Complexity Bound (Q6116246) (← links)
• Trust-region algorithms: probabilistic complexity and intrinsic noise with applications to subsampling techniques (Q6170037) (← links)
• The evaluation complexity of finding high-order minimizers of nonconvex optimization (Q6200212) (← links)