Cover Image

A Projection-Free Method for Solving Convex Bilevel Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Giang-Tran, Khanh-Hung, Ho-Nguyen, Nam, Lee, Dabeen
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C06, 90C25, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

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

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

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

Stochastic Variance-Reduced Forward-Reflected-Backward Splitting Methods for Nonmonotone Generalized Equations
by: Tran-Dinh, Quoc
Published: (2024)

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

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

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

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

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

A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-quadratic Regularized Optimal Transport Problems
by: Yang, Lei, et al.
Published: (2023)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

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

On the convergence of proximal gradient methods for convex simple bilevel optimization
by: Latafat, Puya, et al.
Published: (2023)

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)

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

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

Distributed Computing for Huge-Scale Aggregative Convex Programming
by: Tao, Luoyi
Published: (2026)

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

Parallelizing the Circumcentered-Reflection Method
by: Barros, Pablo, et al.
Published: (2025)

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

On Convergence of Regularized Barzilai-Borwein Method
by: Xu, Xin
Published: (2025)

On Differential Stability of a Class of Convex Optimization Problems
by: Yen, Nguyen Dong, et al.
Published: (2024)

A Parameterized Barzilai-Borwein Method via Interpolated Least Squares
by: Xu, Xin
Published: (2024)

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

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

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

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

A squared smoothing Newton method for semidefinite programming
by: Liang, Ling, et al.
Published: (2023)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
by: Diouane, Youssef, et al.
Published: (2024)

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

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

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

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
by: Hamana, Shodai, et al.
Published: (2026)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

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)