An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms

DOI10.1007/s10898-024-01383-3MaRDI QIDQ6607022

Huiling Zhang, Jiefei He, Zi Xu

Publication date: 17 September 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

iteration complexitynonsmooth problemnonconvex-linear minimax problemapproximation proximal gradient algorithm

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the ergodic convergence rates of a first-order primal-dual algorithm
• An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
• Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
• Coding With Side Information for Rate-Constrained Consensus
• Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning
• Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
• Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems
• An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
• Decentralized Learning for Wireless Communications and Networking
• Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
• A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems

This page was built for publication: An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms