A primal-dual smoothing framework for max-structured non-convex optimization

DOI10.1287/MOOR.2023.1387MaRDI QIDQ6634243zbMATH OpenFDO

Authors Renbo Zhao

Publication date 7 November 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/MOOR.2023.1387

zbMATH Keywords

convex-concave saddle-point problemsnon-convex optimizationnon-Hilbertian inexact accelerated proximal gradientprimal-dual smoothingstochastic optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47)

Recommendations

• First-order primal-dual methods for nonsmooth non-convex optimization
• A smooth primal-dual optimization framework for nonsmooth composite convex minimization
• An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
• A primal-dual algorithm framework for convex saddle-point optimization
• An adaptive primal-dual framework for nonsmooth convex minimization

Cited in

(6)

• An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
• First-order penalty methods for bilevel optimization
• First-order primal-dual methods for nonsmooth non-convex optimization
• A first-order method for nonconvex-strongly-concave constrained minimax optimization
• Single-loop projection-free and projected gradient-based algorithms for nonconvex-concave saddle point problems with bilevel structure
• A first-order augmented Lagrangian method for constrained minimax optimization

This page was built for publication: A primal-dual smoothing framework for max-structured non-convex optimization

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