Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems

DOI10.1109/TAC.2020.3008297zbMath1467.93334arXiv1905.11011MaRDI QIDQ5002058

Meisam Razaviyayn, Hesameddin Mohammadi, Mihailo R. Jovanović

Publication date: 26 July 2021

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.11011

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity (robustness) (93B35) Optimal stochastic control (93E20)

Related Items (5)

Differentially Private Accelerated Optimization Algorithms ⋮ A direct discretization recurrent neurodynamics method for time-variant nonlinear optimization with redundant robot manipulators ⋮ Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems ⋮ Unnamed Item ⋮ Passivity-based analysis of the ADMM algorithm for constraint-coupled optimization

This page was built for publication: Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems