On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
From MaRDI portal
Publication:5358506
DOI10.1109/TCNS.2015.2476198zbMath1370.90196arXiv1409.8033OpenAlexW269003556MaRDI QIDQ5358506
Pradeep Chathuranga Weeraddana, Michael G. Rabbat, Sindri Magnússon, Carlo Fischione
Publication date: 21 September 2017
Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.8033
Related Items (13)
A Parallel Douglas–Rachford Algorithm for Minimizing ROF-like Functionals on Images with Values in Symmetric Hadamard Manifolds ⋮ Unnamed Item ⋮ Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems ⋮ Dynamic behavior analysis via structured rank minimization ⋮ Bregman reweighted alternating minimization and its application to image deblurring ⋮ Distributed model predictive control for continuous‐time nonlinear systems based on suboptimal ADMM ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach ⋮ Proximal algorithms in statistics and machine learning ⋮ Consensus guided incomplete multi-view spectral clustering ⋮ Low-Complexity Method for Hybrid MPC with Local Guarantees ⋮ Alternating direction method of multipliers for solving dictionary learning models
This page was built for publication: On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
