Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
From MaRDI portal
Publication:6064036
DOI10.1007/s10898-022-01169-5OpenAlexW4280553780MaRDI QIDQ6064036
Jingjing Shen, Zi Xu, Zi-Qi Wang
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01169-5
machine learningcomplexity analysisnonconvex-linear minimax problemalternating randomized gradient projection algorithmalternating randomized proximal gradient algorithmzeroth-order algorithm
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Bayesian optimization approach to find Nash equilibria
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Robust optimization with simulated annealing
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Derivative-free robust optimization by outer approximations
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Multicell Coordinated Beamforming With Rate Outage Constraint—Part II: Efficient Approximation Algorithms
- Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem
- 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
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
This page was built for publication: Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
