Imagen de Portada

A Steepest Gradient Method with Nonmonotone Adaptive Step-sizes for the Nonconvex Minimax and Multi-Objective Optimization Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Anh, Nguyen Duc, Thang, Tran Ngoc
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

AGDA+: Proximal Alternating Gradient Descent Ascent Method with a Nonmonotone Adaptive Step-Size Search for Nonconvex Minimax Problems
por: Zhang, Xuan, et al.
Publicado: (2024)

A Novel Approach in Solving Stochastic Generalized Linear Regression via Nonconvex Programming
por: Anh, Vu Duc, et al.
Publicado: (2024)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
por: Lin, Tianyi, et al.
Publicado: (2019)

Adaptive multi-gradient methods for quasiconvex vector optimization and applications to multi-task learning
por: Minh, Nguyen Anh, et al.
Publicado: (2024)

Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization
por: Huang, Feihu, et al.
Publicado: (2023)

Minimax Theorems for Possibly Nonconvex Functions
por: Thieu, Nguyen Nang, et al.
Publicado: (2025)

VFOG: Variance-Reduced Fast Optimistic Gradient Methods for a Class of Nonmonotone Generalized Equations
por: Tran-Dinh, Quoc, et al.
Publicado: (2025)

SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems
por: Zhang, Xuan, et al.
Publicado: (2022)

A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints
por: Tuan, Tran Anh, et al.
Publicado: (2024)

A Simple Adaptive Proximal Gradient Method for Nonconvex Optimization
por: Ye, Zilong, et al.
Publicado: (2025)

A Stochastic GDA Method With Backtracking For Solving Nonconvex Concave Minimax Problems
por: Aybat, Necdet Serhat, et al.
Publicado: (2024)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
por: Zhou, Dongruo, et al.
Publicado: (2018)

Adaptive Regularization within Trust Region Methods for Stochastic Nonconvex Optimization
por: Ha, Yunsoo, et al.
Publicado: (2026)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
por: Lin, Tianyi, et al.
Publicado: (2024)

Projection-Free Algorithms for Minimax Problems
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2026)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
por: Mansueto, Pierluigi
Publicado: (2025)

TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization
por: Li, Xiang, et al.
Publicado: (2022)

Nonsmooth Nonconvex-Concave Minimax Optimization: Convergence Criteria and Algorithms
por: Shi, Jinyang, et al.
Publicado: (2026)

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

A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
por: Wang, Qingsong, et al.
Publicado: (2024)

Efficient Single-Loop Stochastic Algorithms for Nonconvex-Concave Minimax Optimization
por: Jiang, Xia, et al.
Publicado: (2025)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
por: Chen, Lesi, et al.
Publicado: (2025)

A Nonmonotone Descent Method for Optimization Problems Defined by Upper-$\mathcal{C}^2 $ Functions over Submanifolds
por: Kanzow, Christian, et al.
Publicado: (2026)

Solving Minimax Problems with Bilinear Objectives with ADMM
por: Wilson, Bob
Publicado: (2026)

A Homogeneous Second-Order Descent Ascent Algorithm for Nonconvex-Strongly Concave Minimax Problems
por: Chen, Jia-Hao, et al.
Publicado: (2026)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
por: Zhang, Huiling, et al.
Publicado: (2024)

Smoothing Meets Perturbation: Unified and Tight Analysis for Nonconvex-Concave Minimax Optimization
por: Li, Jiajin, et al.
Publicado: (2026)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
por: Ding, Kuangyu, et al.
Publicado: (2024)

Methods of Nonconvex Optimization
por: Mikhalevich, V. S., et al.
Publicado: (2024)

Shuffling Gradient Descent-Ascent with Variance Reduction for Nonconvex-Strongly Concave Smooth Minimax Problems
por: Jiang, Xia, et al.
Publicado: (2024)

Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
por: Nguyen, Lam M., et al.
Publicado: (2024)

A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds
por: Xu, Meng, et al.
Publicado: (2024)

A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems
por: Peng, Huan, et al.
Publicado: (2025)

Nonmonotone Trust-Region Methods for Optimization of Set-Valued Mapping of Finite Cardinality
por: Ghosh, Suprova, et al.
Publicado: (2025)

Zeroth-order Gradient and Quasi-Newton Methods for Nonsmooth Nonconvex Stochastic Optimization
por: Marrinan, Luke, et al.
Publicado: (2023)

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

An Adaptive Proximal Point Method for Nonsmooth and Nonconvex Optimization on Hadamard Manifolds
por: Amaral, Vitaliano S., et al.
Publicado: (2025)

Adaptive Single-Loop Methods for Stochastic Minimax Optimization on Riemannian Manifolds
por: Wang, Hongye, et al.
Publicado: (2026)

Completely Parameter-Free Single-Loop Algorithms for Nonconvex-Concave Minimax Problems
por: Yang, Junnan, et al.
Publicado: (2024)