A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization

DOI10.1016/J.ORL.2024.107181MaRDI QIDQ6988286zbMATH OpenFDO

Authors Akatsuki Nishioka, Yoshihiro Kanno

Publication date 5 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107181

zbMATH Keywords

accelerated gradient methodconvergence rateeigenvalue optimizationsmoothing methodstructural optimization

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical mathematical programming methods (65K05) Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)

Cites work

• A variable smoothing algorithm for solving convex optimization problems
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• First-order methods in optimization
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• Robust Truss Topology Design via Semidefinite Programming
• Smooth convex approximation to the maximum eigenvalue function
• Smooth minimization of non-smooth functions
• Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
• Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
• Smoothing technique and its applications in semidefinite optimization
• The mathematics of eigenvalue optimization
• Topology optimization for worst load conditions based on the eigenvalue analysis of an aggregated linear system
• Twice differentiable spectral functions

Cited in

(1)

• Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization

This page was built for publication: A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988286)