Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
From MaRDI portal
Recommendations
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems
- Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- Noisy zeroth-order optimization for non-smooth saddle point problems
Cites work
- A Bayesian optimization approach to find Nash equilibria
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- 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
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems
- An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem
- Derivative-free robust optimization by outer approximations
- Efficient search of first-order Nash equilibria in nonconvex-concave smooth min-max problems
- Gradient-Free Methods with Inexact Oracle for Convex-Concave Stochastic Saddle-Point Problem
- scientific article; zbMATH DE number 3557086 (Why is no real title available?)
- scientific article; zbMATH DE number 1466435 (Why is no real title available?)
- scientific article; zbMATH DE number 913711 (Why is no real title available?)
- scientific article; zbMATH DE number 7625189 (Why is no real title available?)
- scientific article; zbMATH DE number 7064064 (Why is no real title available?)
- Hybrid Block Successive Approximation for One-Sided Non-Convex Min-Max Problems: Algorithms and Applications
- Multicell Coordinated Beamforming With Rate Outage Constraint—Part II: Efficient Approximation Algorithms
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the information-adaptive variants of the ADMM: an iteration complexity perspective
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Robust optimization with simulated annealing
- Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
Cited in
(7)- Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- Gradient norm regularization second-order algorithms for solving nonconvex-strongly concave minimax problems
- An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
- An alternating proximal gradient algorithm for nonsmooth nonconvex-linear minimax problems with coupled linear constraints
- An alternating gradient projection algorithm with momentum for nonconvex-concave minimax problems
This page was built for publication: Zeroth-order single-loop algorithms for nonconvex-linear minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064036)
