Cover Image

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abolfazli, Nazanin, Jiang, Ruichen, Mokhtari, Aryan, Hamedani, Erfan Yazdandoost
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2024)

Safe Gradient Flow for Bilevel Optimization
by: Sharifi, Sina, et al.
Published: (2025)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2025)

Single-loop Projection-free and Projected Gradient-based Algorithms for Nonconvex-concave Saddle Point Problems with Bilevel Structure
by: Ahmadi, Mohammad Mahdi, et al.
Published: (2024)

Sequential QCQP for Bilevel Optimization with Line Search
by: Sharifi, Sina, et al.
Published: (2025)

Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
by: Ahmadi, Mohammad Mahdi, et al.
Published: (2025)

Semi-infinite Nonconvex Constrained Min-Max Optimization
by: Melcher, Cody, et al.
Published: (2025)

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
by: Jiang, Ruichen, et al.
Published: (2024)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
by: Hamedani, Erfan Yazdandoost, et al.
Published: (2019)

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
by: Melcher, Cody, et al.
Published: (2025)

Variance-reduction for Variational Inequality Problems with Bregman Distance Function
by: Alizadeh, Zeinab, et al.
Published: (2024)

Improved Complexity for Smooth Nonconvex Optimization: A Two-Level Online Learning Approach with Quasi-Newton Methods
by: Jiang, Ruichen, et al.
Published: (2024)

Online Learning-guided Learning Rate Adaptation via Gradient Alignment
by: Jiang, Ruichen, et al.
Published: (2025)

Stochastic Newton Proximal Extragradient Method
by: Jiang, Ruichen, et al.
Published: (2024)

Improving Online-to-Nonconvex Conversion for Smooth Optimization via Double Optimism
by: Patitucci, Francisco, et al.
Published: (2025)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Non-asymptotic Global Convergence Rates of BFGS with Exact Line Search
by: Jin, Qiujiang, et al.
Published: (2024)

Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search
by: Jin, Qiujiang, et al.
Published: (2024)

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

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
by: Jiang, Ruichen, et al.
Published: (2024)

Conditional Gradient Methods
by: Braun, Gábor, et al.
Published: (2022)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
by: Jiang, Ruichen, et al.
Published: (2026)

On the Analysis of Misspecified Variational Inequalities with Nonlinear Constraints
by: Dey, Novel Kumar, et al.
Published: (2026)

Adaptive Optimization via Momentum on Variance-Normalized Gradients
by: Patitucci, Francisco, et al.
Published: (2026)

Bilevel Learning with Inexact Stochastic Gradients
by: Salehi, Mohammad Sadegh, et al.
Published: (2024)

Conditional Gradient Methods with Standard LMO for Stochastic Simple Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Krylov Cubic Regularized Newton: A Subspace Second-Order Method with Dimension-Free Convergence Rate
by: Jiang, Ruichen, et al.
Published: (2024)

Inexactly Smooth Performance Estimation and New Optimized Gradient Methods
by: Zoll, Aaron, et al.
Published: (2026)

On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
by: Kuruzov, Ilya, et al.
Published: (2024)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Second-Order Optimality Conditions for Nonsmooth Constrained Optimization with Applications to Bilevel Programming
by: Liu, Xiang, et al.
Published: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

First-Order Methods for Linearly Constrained Bilevel Optimization
by: Kornowski, Guy, et al.
Published: (2024)

An Adaptively Inexact Method for Bilevel Learning Using Primal-Dual Style Differentiation
by: Bogensperger, Lea, et al.
Published: (2024)

Statistical and Computational Complexities of BFGS Quasi-Newton Method for Generalized Linear Models
by: Jin, Qiujiang, et al.
Published: (2022)

An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
by: Macedo, Humberto Gimenes, et al.
Published: (2025)

Convergence Analysis of an Inexact MBA Method for Constrained DC Problems
by: Liu, Ruyu, et al.
Published: (2025)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
by: Jiang, Xiaotian, et al.
Published: (2026)