Proximal ADMM for nonconvex and nonsmooth optimization
From MaRDI portal
Abstract: By enabling the nodes or agents to solve small-sized subproblems to achieve coordination, distributed algorithms are favored by many networked systems for efficient and scalable computation. While for convex problems, substantial distributed algorithms are available, the results for the more broad nonconvex counterparts are extremely lacking. This paper develops a distributed algorithm for a class of nonconvex and nonsmooth problems featured by i) a nonconvex objective formed by both separate and composite objective components regarding the decision components of interconnected agents, ii) local bounded convex constraints, and iii) coupled linear constraints. This problem is directly originated from smart buildings and is also broad in other domains. To provide a distributed algorithm with convergence guarantee, we revise the powerful tool of alternating direction method of multiplier (ADMM) and proposed a proximal ADMM. Specifically, noting that the main difficulty to establish the convergence for the nonconvex and nonsmooth optimization within the ADMM framework is to assume the boundness of dual updates, we propose to update the dual variables in a discounted manner. This leads to the establishment of a so-called sufficiently decreasing and lower bounded Lyapunov function, which is critical to establish the convergence. We prove that the method converges to some approximate stationary points. We besides showcase the efficacy and performance of the method by a numerical example and the concrete application to multi-zone heating, ventilation, and air-conditioning (HVAC) control in smart buildings.
Recommendations
- A two-level distributed algorithm for nonconvex constrained optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Distributed nonconvex constrained optimization over time-varying digraphs
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
Cites work
- Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background/foreground extraction
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Generalized symmetric ADMM for separable convex optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- Linearized ADMM Converges to Second-Order Stationary Points for Non-Convex Problems
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- Non-convex optimization for machine learning
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
- On the Convergence of a Distributed Augmented Lagrangian Method for Nonconvex Optimization
- On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- On the sublinear convergence rate of multi-block ADMM
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Tracking-ADMM for distributed constraint-coupled optimization
Cited in
(14)- Global convergence of ADMM in nonconvex nonsmooth optimization
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- A proximal ADMM with the Broyden family for convex optimization problems
- A two-level distributed algorithm for nonconvex constrained optimization
- ADMM and Non-convex Variational Problems
- ALADIN‐—An open‐source MATLAB toolbox for distributed non‐convex optimization
- Nonlinear model predictive control to automatic train regulation of metro system: an exact solution for embedded applications
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Variance-reduced reshuffling gradient descent for nonconvex optimization: centralized and distributed algorithms
- Variable projection algorithms: theoretical insights and a novel approach for problems with large residual
- Time-varying distributed fuzzy resource allocation for multi-agent system over switching topology
- Stochastic ADMM with variance-reduced recursive momentum and its accelerated variant for nonconvex nonsmooth optimization
- A -inertial ADMM for efficient and stable nonconvex optimization
This page was built for publication: Proximal ADMM for nonconvex and nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097703)
