Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

Unnamed Item
A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron
User-friendly tail bounds for sums of random matrices
A constrained optimization reformulation and a feasible descent direction method for $L_{1/2}$ regularization
An improved algorithm for the $L_2-L_p$ minimization problem
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
An interior stochastic gradient method for a class of non-Lipschitz optimization problems
Complexity of unconstrained $L_2 - L_p$ minimization
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
Linearly Constrained Non-Lipschitz Optimization for Image Restoration
Variational Analysis
Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
MultiComposite Nonconvex Optimization for Training Deep Neural Networks
Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints
Penalty Methods for a Class of Non-Lipschitz Optimization Problems
The evaluation complexity of finding high-order minimizers of nonconvex optimization

This page was built for publication: Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization