Pages that link to "Item:Q4634141"
From MaRDI portal
The following pages link to Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141):
Displaying 12 items.
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- An adaptive high order method for finding third-order critical points of nonconvex optimization (Q2079692) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- Complexity of unconstrained \(L_2 - L_p\) minimization (Q2436652) (← links)
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy (Q4629334) (← links)
- Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives (Q4971023) (← links)
- On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
- Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
- A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization (Q5131958) (← links)
- On High-Order Multilevel Optimization Strategies (Q5147030) (← 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)
