Pages that link to "Item:Q5101935"
From MaRDI portal
The following pages link to Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives (Q5101935):
Displaying 14 items.
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- (Q4198634) (← links)
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826) (← links)
- Multilevel Objective-Function-Free Optimization with an Application to Neural Networks Training (Q6076869) (← 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)
- Adaptive Third-Order Methods for Composite Convex Optimization (Q6171322) (← links)
- Gradient descent in the absence of global Lipschitz continuity of the gradients (Q6583712) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
- Complexity analysis of regularization methods for implicitly constrained least squares (Q6635781) (← links)
- Worst case complexity bounds for linesearch-type derivative-free algorithms (Q6636792) (← links)
- Shape-changing trust-region methods using multipoint symmetric secant matrices (Q6644991) (← links)
- Perseus: a simple and optimal high-order method for variational inequalities (Q6665392) (← links)
