Cover Image

Fully First-Order Methods for Decentralized Bilevel Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Xiaoyu, Chen, Xuxing, Ma, Shiqian, Zhang, Tong
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 90C06, 90C15, 90C47
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
by: Wang, Junlin, et al.
Published: (2024)

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

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
by: Qiu, Junwen, et al.
Published: (2026)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
by: Xiaoyu, Luo, et al.
Published: (2024)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

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

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

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

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

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

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

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

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

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

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

Stochastic block coordinate and function alternation for multi-objective optimization and learning
by: Tran, Trang H., et al.
Published: (2026)

Robust Utility Maximization with Intractable Claims under Distributional Ambiguity: A Random Distributionally Robust Optimization Approach
by: Guan, Guohui, et al.
Published: (2025)

Level Constrained First Order Methods for Function Constrained Optimization
by: Boob, Digvijay, et al.
Published: (2022)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

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

Stochastic Optimization under Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2023)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)

Variance-Reduced Fast Operator Splitting Methods for Generalized Equations
by: Tran-Dinh, Quoc
Published: (2025)

Multivariate approximation by polynomial and generalised rational functions
by: Millán, R. Díaz, et al.
Published: (2021)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

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

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems
by: Tran-Dinh, Quoc
Published: (2024)

Accelerated Extragradient-Type Methods -- Part 2: Generalization and Sublinear Convergence Rates under Co-Hypomonotonicity
by: Tran-Dinh, Quoc, et al.
Published: (2025)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
by: Wang, Xuejie, et al.
Published: (2023)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
by: Thomä, Simon, et al.
Published: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization
by: Zhang, Hengrui, et al.
Published: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

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

Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
by: Roth, Jake, et al.
Published: (2024)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)