Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
type: Item
instance of: scholarly article
title: Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
author: Xiao Wang
author: Xiaojun Chen
published in: SIAM Journal on Optimization
publication date: 2024-07-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7887988
zbMATH Keywords: nonconvexity
zbMATH Keywords: nonsmoothness
zbMATH Keywords: non-Lipschitz regularization
zbMATH Keywords: inexact oracle
zbMATH Keywords: complexity
MaRDI profile type: Publication
cites work: Linearly Constrained Non-Lipschitz Optimization for Image Restoration
cites work: Optimality and Complexity for Constrained Optimization Problems with Nonconvex Regularization
cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
cites work: On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
cites work: Sharp Worst-Case Evaluation Complexity Bounds for Arbitrary-Order Nonconvex Optimization with Inexpensive Constraints
cites work: The evaluation complexity of finding high-order minimizers of nonconvex optimization
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: Penalty Methods for a Class of Non-Lipschitz Optimization Problems
cites work: High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
cites work: Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
cites work: An interior stochastic gradient method for a class of non-Lipschitz optimization problems
cites work: MultiComposite Nonconvex Optimization for Training Deep Neural Networks
cites work: An improved algorithm for the \(L_2-L_p\) minimization problem
cites work: An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
cites work: Q3999407
cites work: A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
cites work: A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
cites work: Variational Analysis
cites work: User-friendly tail bounds for sums of random matrices
DOI: 10.1137/23M1546701
description: scientific article; zbMATH DE number 7887988