Pages that link to "Item:Q2020598"
From MaRDI portal
The following pages link to An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity (Q2020598):
Displaying 14 items.
- Inexact derivative-free optimization for bilevel learning (Q2036198) (← links)
- Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives (Q2052165) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- Inexact restoration for derivative-free expensive function minimization and applications (Q2122038) (← links)
- The impact of noise on evaluation complexity: the deterministic trust-region case (Q2696963) (← links)
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization (Q2866204) (← links)
- An Algorithm for Nonsmooth Convex Minimization With Errors (Q3707271) (← links)
- Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction (Q5860374) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← 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)
- 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)
