Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
From MaRDI portal
Recommendations
- Inexact proximal stochastic second-order methods for nonconvex composite optimization
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Cites work
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- A smoothing SQP framework for a class of composite L_q minimization over polyhedron
- An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
- An improved algorithm for the \(L_2-L_p\) minimization problem
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Complexity of unconstrained \(L_2 - L_p\) minimization
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- scientific article; zbMATH DE number 49594 (Why is no real title available?)
- Linearly constrained non-Lipschitz optimization for image restoration
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Multicomposite nonconvex optimization for training deep neural networks
- On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Penalty methods for a class of non-Lipschitz optimization problems
- Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
- The evaluation complexity of finding high-order minimizers of nonconvex optimization
- User-friendly tail bounds for sums of random matrices
- Variational Analysis
This page was built for publication: Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579994)
