Copertina

A first-order method for nonconvex-strongly-concave constrained minimax optimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lu, Zhaosong, Mei, Sanyou
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control Machine Learning Numerical Analysis 90C26, 90C30, 90C47, 90C99, 65K05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A first-order augmented Lagrangian method for constrained minimax optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2023)

Solving bilevel optimization via sequential minimax optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

First-order penalty methods for bilevel optimization
di: Lu, Zhaosong, et al.
Pubblicazione: (2023)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
di: Lu, Zhaosong, et al.
Pubblicazione: (2025)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
di: Lu, Zhaosong, et al.
Pubblicazione: (2024)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
di: Yao, Tongliang, et al.
Pubblicazione: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
di: Deng, Kangkang, et al.
Pubblicazione: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
di: Hu, Yaling, et al.
Pubblicazione: (2026)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
di: Marumo, Naoki, et al.
Pubblicazione: (2023)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
di: Mannel, Florian
Pubblicazione: (2024)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
di: Chen, Xiaojun, et al.
Pubblicazione: (2022)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
di: Kanzow, Christian, et al.
Pubblicazione: (2025)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
di: Kong, Weiwei
Pubblicazione: (2022)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
di: Li, Qia, et al.
Pubblicazione: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
di: Monteiro, Renato D. C., et al.
Pubblicazione: (2024)

A novel numerical method tailored for unconstrained optimization problems
di: Li, Lin, et al.
Pubblicazione: (2025)

Time-integrated Optimal Transport: A Robust Minimax Framework
di: Nguyen, Thai P. D., et al.
Pubblicazione: (2025)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
di: László, Szilárd Csaba
Pubblicazione: (2025)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
di: Gfrerer, H.
Pubblicazione: (2024)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
di: Krejić, Nataša, et al.
Pubblicazione: (2025)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
di: Dolgopolik, M. V.
Pubblicazione: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
di: Pérez-Aros, Pedro, et al.
Pubblicazione: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
di: Zhou, Junpeng, et al.
Pubblicazione: (2025)

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
di: Ma, Bohao, et al.
Pubblicazione: (2026)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
di: Zeng, Hanfeng, et al.
Pubblicazione: (2026)

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
di: Turan, Evren M., et al.
Pubblicazione: (2023)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
di: Zhou, Juan, et al.
Pubblicazione: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
di: Marumo, Naoki, et al.
Pubblicazione: (2022)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
di: Brosch, Daniel, et al.
Pubblicazione: (2025)

An interior point method for nonlinear constrained derivative-free optimization
di: Brilli, Andrea, et al.
Pubblicazione: (2021)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
di: Peiris, Vinesha, et al.
Pubblicazione: (2026)

A structured L-BFGS method and its application to inverse problems
di: Mannel, Florian, et al.
Pubblicazione: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
di: Mannel, Florian, et al.
Pubblicazione: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
di: Latafat, Puya, et al.
Pubblicazione: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, et al.
Pubblicazione: (2025)

Adaptive proximal gradient methods are universal without approximation
di: Oikonomidis, Konstantinos A., et al.
Pubblicazione: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
di: Xie, Xiyuan, et al.
Pubblicazione: (2025)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
di: Xie, Lijun, et al.
Pubblicazione: (2025)