An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
DOI10.1007/S10898-024-01383-3MaRDI QIDQ6607022FDOQ6607022
Authors: Jiefei He, Huiling Zhang, Zi Xu 
Publication date: 17 September 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Recommendations
- Semi-proximal point method for nonsmooth convex-concave minimax optimization
- A proximal alternating linearization method for nonconvex optimization problems
- Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
iteration complexitynonsmooth problemnonconvex-linear minimax problemapproximation proximal gradient algorithm
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)
Cites Work
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Coding With Side Information for Rate-Constrained Consensus
- Decentralized learning for wireless communications and networking
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
- Title not available (Why is that?)
- Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
Cited In (4)
- Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
- Semi-proximal point method for nonsmooth convex-concave minimax optimization
- Proximal point algorithms for nonconvex-nonconcave minimax optimization problems
- Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
This page was built for publication: An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607022)
