An implicit gradient-descent procedure for minimax problems

DOI10.1007/S00186-022-00805-WOpenAlexW2947405306MaRDI QIDQ2699028FDOQ2699028

Esteban G. Tabak, Giulio Trigila, Montacer Essid

Publication date: 26 April 2023

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.00233

zbMATH Keywords

game theoryoptimal transportadversarial optimizationsaddle point optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
• Updating Quasi-Newton Matrices with Limited Storage
• Title not available (Why is that?)
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Numerical solution of saddle point problems
• Title not available (Why is that?)
• Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
• Numerical methods for matching for teams and Wasserstein barycenters
• Certified Reduced Basis Methods for Parametrized Saddle Point Problems
• Data-driven optimal transport
• A new fast method to compute saddle-points in constrained optimization and applications
• Solutions of Saddle Value Problems by Differential Equations
• A Family of Nonparametric Density Estimation Algorithms
• Conditional density estimation and simulation through optimal transport
• Adaptive optimal transport

Cited In (3)

• An implicit gradient-descent procedure for minimax problems
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• L-BFGS

   Recommendations

• Projection generalized two-point extragradient quasi-Newton method for saddle-point and other problems 👍 👎
• One-point gradient-free methods for smooth and non-smooth saddle-point problems 👍 👎
• Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems 👍 👎
• Gradient Transformation Trajectory Following Algorithms for Determining Stationary Min-Max Saddle Points 👍 👎
• Cubic regularized Newton method for the saddle point models: a global and local convergence analysis 👍 👎

This page was built for publication: An implicit gradient-descent procedure for minimax problems

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