Imagen de Portada

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Wang, Junlin, Xu, Zi, Zhang, Huiling
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning 90C47, 90C26, 90C30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
por: Wang, Jun-Lin, et al.
Publicado: (2024)

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

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
por: Fatkhullin, Ilyas, et al.
Publicado: (2025)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
por: Jiang, Ruichen, et al.
Publicado: (2022)

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

Fully First-Order Methods for Decentralized Bilevel Optimization
por: Wang, Xiaoyu, et al.
Publicado: (2024)

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

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
por: de Brito, Jose, et al.
Publicado: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
por: de Brito, José, et al.
Publicado: (2025)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
por: Khanh, Phan Quoc, et al.
Publicado: (2025)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
por: Higuchi, Rei, et al.
Publicado: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
por: Xie, Yue, et al.
Publicado: (2024)

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

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

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

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

A first-order method for nonconvex-strongly-concave constrained minimax optimization
por: Lu, Zhaosong, et al.
Publicado: (2025)

Alternating minimization for square root principal component pursuit
por: Deng, Shengxiang, et al.
Publicado: (2024)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
por: Qiu, Junwen, et al.
Publicado: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
por: Lapucci, Matteo, et al.
Publicado: (2024)

High Probability Guarantees for Random Reshuffling
por: Yu, Hengxu, et al.
Publicado: (2023)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
por: Cesaroni, Edoardo, et al.
Publicado: (2026)

Continuous models combining slacks-based measures of efficiency and super-efficiency
por: Bolos, Vicente J., et al.
Publicado: (2024)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
por: Dai, Yu-Hong, et al.
Publicado: (2024)

A Generalized Version of Chung's Lemma and its Applications
por: Jiang, Li, et al.
Publicado: (2024)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
por: Xie, Yue, et al.
Publicado: (2025)

Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
por: K, Mishal Assif P, et al.
Publicado: (2019)

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

A Surrogate Value Function Formulation for Bilevel Optimization
por: Xu, Mengwei, et al.
Publicado: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
por: Gómez-Casares, Ignacio, et al.
Publicado: (2025)

Application and issues in abstract convexity
por: Millán, Reinier Díaz, et al.
Publicado: (2022)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
por: Mashkoorzadeh, Feryal, et al.
Publicado: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
por: Tang, Tianyun, et al.
Publicado: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
por: Jia, Xiaoxi, et al.
Publicado: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
por: Lapucci, Matteo, et al.
Publicado: (2024)

A Globally Convergent Gradient Method with Momentum
por: Lapucci, Matteo, et al.
Publicado: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
por: Cecere, Francesco, et al.
Publicado: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
por: González-Díaz, Julio, et al.
Publicado: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
por: Ghaffari-Hadigheh, Alireza, et al.
Publicado: (2022)