Cover Image

Computer-Assisted Design of Accelerated Composite Optimization Methods: OptISTA

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jang, Uijeong, Gupta, Shuvomoy Das, Ryu, Ernest K.
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

Point Convergence of Nesterov's Accelerated Gradient Method: An AI-Assisted Proof
by: Jang, Uijeong, et al.
Published: (2025)

Optimal Acceleration for Proximal Minimization of the Sum of Convex and Strongly Convex Functions
by: Chari, Govind M., et al.
Published: (2026)

ALiA: Adaptive Linearized ADMM
by: Jang, Uijeong, et al.
Published: (2026)

LoRA Training in the NTK Regime has No Spurious Local Minima
by: Jang, Uijeong, et al.
Published: (2024)

Sharpness-Aware Minimization Can Hallucinate Minimizers
by: Park, Chanwoong, et al.
Published: (2025)

Exterior-point Optimization for Sparse and Low-rank Optimization
by: Gupta, Shuvomoy Das, et al.
Published: (2020)

Stochastic ISTA/FISTA Adaptive Step Search Algorithms for Convex Composite Optimization
by: Nguyen, Lam M., et al.
Published: (2024)

Energy-optimal Timetable Design for Sustainable Metro Railway Networks
by: Gupta, Shuvomoy Das, et al.
Published: (2023)

Accelerated Minimax Algorithms Flock Together
by: Yoon, TaeHo, et al.
Published: (2022)

Nesterov Acceleration with Operator Decomposition
by: Lee, Jaewook, et al.
Published: (2026)

Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses
by: Gupta, Shuvomoy Das, et al.
Published: (2023)

Nesterov Flow May Travel Infinitely Long to Converge to a Minimizer
by: Ryu, Ernest K.
Published: (2026)

Uniqueness of DRS as the 2 Operator Resolvent-Splitting and Impossibility of 3 Operator Resolvent-Splitting
by: Ryu, Ernest K.
Published: (2018)

The AutoLyap software suite for computer-assisted Lyapunov analyses of first-order methods
by: Upadhyaya, Manu, et al.
Published: (2025)

Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems
by: Paeng, Jinhee, et al.
Published: (2023)

Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique
by: Yoon, TaeHo, et al.
Published: (2024)

Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processes
by: Lee, Jongmin, et al.
Published: (2025)

Optimal First-Order Algorithms as a Function of Inequalities
by: Park, Chanwoo, et al.
Published: (2021)

NonOpt: Nonconvex, Nonsmooth Optimizer
by: Curtis, Frank E., et al.
Published: (2025)

Mirror Duality in Convex Optimization
by: Kim, Jaeyeon, et al.
Published: (2023)

Convergence Analyses of Davis-Yin Splitting via Scaled Relative Graphs
by: Lee, Jongmin, et al.
Published: (2022)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
by: Lee, Jongmin, et al.
Published: (2026)

H-invariance theory: A complete characterization of minimax optimal fixed-point algorithms
by: Yoon, TaeHo, et al.
Published: (2025)

Boosting Accelerated Proximal Gradient Method with Adaptive Sampling for Stochastic Composite Optimization
by: Zhu, Dongxuan, et al.
Published: (2025)

Restart-Free (Accelerated) Gradient Sliding Methods for Strongly Convex Composite Optimization
by: Wu, Xinming, et al.
Published: (2026)

Zeroth-Order Katyusha: An Accelerated Derivative-Free Method for Composite Convex Optimization
by: Zhang, Silan, et al.
Published: (2024)

Scaled Relative Graph of Normal Matrices
by: Huang, Xinmeng, et al.
Published: (2019)

Accelerated Backward Forward Method for Convex Optimization
by: Wang, Zepeng, et al.
Published: (2026)

ADMM for 0/1 D-Opt and MESP relaxations
by: Ponte, Gabriel, et al.
Published: (2024)

Robust Accelerated Primal-Dual Methods for Computing Saddle Points
by: Zhang, Xuan, et al.
Published: (2021)

Accelerated Proximal Gradient Method with Backtracking for Multiobjective Optimization
by: Huang, Chengzhi, et al.
Published: (2024)

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
by: Wang, Zepeng, et al.
Published: (2025)

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

Customized Interior-Point Methods Solver for Embedded Real-Time Convex Optimization
by: Jang, Jae-Il, et al.
Published: (2025)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
by: Ren, Yijin, et al.
Published: (2025)

Historical Information Accelerates Decentralized Optimization: A Proximal Bundle Method
by: Zhu, Zhao, et al.
Published: (2025)

Accelerated Alternating Direction Method of Multipliers Gradient Tracking for Distributed Optimization
by: Sebastián, Eduardo, et al.
Published: (2024)

INTHOP: A Second-Order Globally Convergent Method for Nonconvex Optimization
by: Kumar, Krishan, et al.
Published: (2025)

Deflated Dynamics Value Iteration
by: Lee, Jongmin, et al.
Published: (2024)

MathOptInterface: a data structure for mathematical optimization problems
by: Legat, Benoit, et al.
Published: (2020)