Cover Image

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bai, Xiaoning, Zeng, Shangzhi, Zhang, Jin, Zhang, Lezhi
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C26, 90C30, 49M37, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)

An Inexact Proximal Linearized DC Algorithm with Provably Terminating Inner Loop
by: Zhang, Yi, et al.
Published: (2023)

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

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
by: Takahashi, Shota, et al.
Published: (2023)

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

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
by: Gao, Lucy L., et al.
Published: (2023)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

An Inexact Regularized Proximal Newton Method without Line Search
by: Dahl, Simeon vom, et al.
Published: (2024)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

Retractions by Alternating Projections
by: Chen, Shixiang, et al.
Published: (2026)

Bilevel Learning via Inexact Stochastic Gradient Descent
by: Salehi, Mohammad Sadegh, et al.
Published: (2025)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
by: Braun, Gábor, et al.
Published: (2024)

Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
by: Zhang, Penghe, et al.
Published: (2025)

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

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

A multiscale Consensus-Based algorithm for multi-level optimization
by: Herty, Michael, et al.
Published: (2024)

Exploiting cone approximations in an augmented Lagrangian method for conic optimization
by: Fukuda, Mituhiro, et al.
Published: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy
by: He, Yitong, et al.
Published: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
by: Goldfarb, Donald, et al.
Published: (2025)

Cubic Regularization Technique of the Newton Method for Vector Optimization
by: Ghosh, Debdas
Published: (2025)

Switching Point Optimization for Abstract Parabolic Equations
by: Buchheim, Christoph, et al.
Published: (2026)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
by: Ferreira, Orizon P., et al.
Published: (2024)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong
Published: (2024)

A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models
by: Nie, Wanqin, et al.
Published: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\ge 3$
by: Zhang, Lixing
Published: (2026)

Convergence analysis of the transformed gradient projection algorithms on compact matrix manifolds
by: Ding, Wentao, et al.
Published: (2024)

Error Bounds for Rank-one Double Nonnegative Reformulations of QAP and Exact Penalties
by: Qian, Yitian, et al.
Published: (2024)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
by: Han, Deren, et al.
Published: (2025)

A cut-and-project perspective for linearized Bregman iterations
by: Dai, Yu-Hong, et al.
Published: (2024)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)