Adaptive method for saddle point problems with a generalization of smoothness property

DOI10.1007/978-3-031-97077-1_3MaRDI QIDQ6884696zbMATH OpenFDO

Authors Mahmoud Karafallah, F. S. Stonyakin, Mohammad S. Alkousa

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97077-1_3

zbMATH Keywords

non-smooth optimizationproblems with functional constraintsrestartsaddle point problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Minimax problems in mathematical programming (90C47)

Cites work

• A unified distributed method for constrained networked optimization via saddle-point dynamics
• Accelerated methods for saddle-point problem
• Convergence Analysis of Saddle Point Problems in Time Varying Wireless Systems— Control Theoretical Approach
• Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems
• Lectures on convex optimization
• One-point gradient-free methods for smooth and non-smooth saddle-point problems
• Solving strongly convex-concave composite saddle-point problems with low dimension of one group of variable
• Stochastic saddle-point optimization for the Wasserstein barycenter problem
• Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization
• Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning

This page was built for publication: Adaptive method for saddle point problems with a generalization of smoothness property

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