Cover Image

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Abolfazli, Nazanin, Sharifi, Sina, Fazlyab, Mahyar, Hamedani, Erfan Yazdandoost
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)

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)

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

Model Predictive Path Integral Control as Preconditioned Gradient Descent
by: Fazlyab, Mahyar, et al.
Published: (2026)

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

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

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

Generalized Model Predictive Path Integral Control as Expectation--Maximization
by: Wang, Jiarui, et al.
Published: (2026)

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

Variance-reduction for Variational Inequality Problems with Bregman Distance Function
by: Alizadeh, Zeinab, 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)

Anytime-Feasible First-Order Optimization via Safe Sequential QCQP
by: Wang, Jiarui, et al.
Published: (2025)

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

Provable Bounds on the Hessian of Neural Networks: Derivative-Preserving Reachability Analysis
by: Sharifi, Sina, et al.
Published: (2024)

Perturbed Proximal Gradient ADMM for Nonconvex Composite Optimization
by: Zhou, Yuan, et al.
Published: (2025)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

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

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
by: Kwon, Jeongyeol, et al.
Published: (2023)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
by: Ji, Kaiyi
Published: (2025)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

A Communication-Efficient Stochastic Gradient Descent Algorithm for Distributed Nonconvex Optimization
by: Xie, Antai, et al.
Published: (2024)

A Single-Loop Gradient Algorithm for Pessimistic Bilevel Optimization via Smooth Approximation
by: Cao, Qichao, et al.
Published: (2025)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
by: Xiao, Nachuan, et al.
Published: (2025)

Adaptive Algorithms for Nonconvex Bilevel Optimization under PŁ Conditions
by: Shi, Xu, et al.
Published: (2025)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
by: Wang, Jun-Kun
Published: (2024)

Online Nonconvex Bilevel Optimization with Bregman Divergences
by: Bohne, Jason, et al.
Published: (2024)

On Penalty-based Bilevel Gradient Descent Method
by: Shen, Han, et al.
Published: (2023)

Parametric Nonconvex Optimization via Convex Surrogates
by: Wang, Renzi, et al.
Published: (2026)

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

Input-to-State Stability of a Bilevel Proximal Gradient Descent Algorithm
by: Kolmanovsky, Torbjørn Cunis Ilya
Published: (2022)

Riemannian Inexact Gradient Descent for Quadratic Discrimination
by: Talwar, Uday, et al.
Published: (2025)

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization
by: Lu, Songtao
Published: (2022)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation
by: Lu, Cheng, et al.
Published: (2025)

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

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

A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP
by: Peng, Zedong, et al.
Published: (2024)

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization
by: Sato, Naoki, et al.
Published: (2023)