Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints

DOI10.1016/j.sysconle.2020.104824zbMath1456.90159OpenAlexW3106417786MaRDI QIDQ826824

Mitsuru Toyoda, Mirai Tanaka

Publication date: 6 January 2021

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2020.104824

zbMATH Keywords

convergence analysisoptimal controlproximal algorithmsparse optimizationalternating direction method of multipliers (ADMM)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

Efficient iterative method for SOAV minimization problem with linear equality and box constraints and its linear convergence

Uses Software

• Gurobi
• CRAN
• KELLEY
• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Characterization of maximum hands-off control
• On the linear convergence of the alternating direction method of multipliers
• Identification of switched linear systems via sparse optimization
• Sparse and constrained stochastic predictive control for networked systems
• Discretisation of sparse linear systems: an optimisation approach
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the computation of sparse solutions to the controllability problem for discrete-time linear systems
• An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Proximal Splitting Methods in Signal Processing
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
• Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
• Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
• Linear-quadratic control problems withL¹-control cost
• Tight Global Linear Convergence Rate Bounds for Operator Splitting Methods
• Sparsity of Linear Discrete-Time Optimal Control Problems With $l_1$ Objectives
• On Sparse Optimal Control for General Linear Systems
• The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
• Discrete-Valued Control of Linear Time-Invariant Systems by Sum-of-Absolute-Values Optimization
• Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs

This page was built for publication: Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints