A proximal variable smoothing method with backtracking stepsizes finds stationary points for nonlinearly composite nonsmooth optimization with O(epsilon^-3) iteration complexity.
An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
ACCEPT 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
A Proximal Variable Smoothing for Minimization of Nonlinearly Composite Nonsmooth Function -- Finite-Max Minimization and MIMO Applications
A proximal variable smoothing method with backtracking stepsizes finds stationary points for nonlinearly composite nonsmooth optimization with O(epsilon^-3) iteration complexity.