Cover Image

Dynamic FISTA for Convex Composite Bi-Level Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Merchav, Roey, Sabach, Shoham, Teboulle, Marc
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C25, 65K05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Strong Convergence of FISTA for Affinely Constrained Convex Quadratic Minimization
by: Bartz, Sedi, et al.
Published: (2026)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
by: Kamijima, Tomoya, et al.
Published: (2025)

Bregman proximal gradient method for linear optimization under entropic constraints
by: Briceño-Arias, Luis M., et al.
Published: (2025)

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

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

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

Essential Convergence Rates of Continuous-Time Models for Optimization Methods
by: Ushiyama, Kansei, et al.
Published: (2025)

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

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

On Averaging and Extrapolation for Gradient Descent
by: Luner, Alan, et al.
Published: (2024)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

Understanding FISTA's weak convergence: A step-by-step introduction to the 2025 milestone
by: Bauschke, Heinz H., et al.
Published: (2026)

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

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, et al.
Published: (2025)

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
by: Alshahrani, Mohammed
Published: (2026)

Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025)

A Three-Operator Splitting Scheme Derived from Three-Block ADMM
by: Anshika, Anshika, et al.
Published: (2024)

Relaxed and Inertial Nonlinear Forward-Backward with Momentum
by: Roldán, Fernando, et al.
Published: (2024)

Relaxed and inertial nonlinear Forward-Backward algorithm
by: Maulén, Juan José, et al.
Published: (2025)

Preconditioned primal-dual dynamics in convex optimization: non-ergodic convergence rates
by: Apidopoulos, Vassilis, et al.
Published: (2025)

Forward Primal-Dual Half-Forward Algorithm for Splitting Four Operators
by: Roldán, Fernando
Published: (2023)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
by: Ran, Yifan
Published: (2023)

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
by: Traoré, Cheik, et al.
Published: (2025)

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

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
by: Boţ, Radu Ioan, et al.
Published: (2025)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Distributed gradient methods under heavy-tailed communication noise
by: Vukovic, Manojlo, et al.
Published: (2025)

Convexity of Optimization Curves: Local Sharp Thresholds, Robustness Impossibility, and New Counterexamples
by: Hieu, Le Duc
Published: (2025)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
by: Nandhan, Navil, et al.
Published: (2026)