Pages that link to "Item:Q2020600"

The following pages link to High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600):

Displaying 7 items.

• 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)
• (Q5037987) (← 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)
• 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)