A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
From MaRDI portal
Publication:301677
DOI10.1007/s10589-016-9826-0zbMath1352.90071OpenAlexW2297927615MaRDI QIDQ301677
Zhaoyang Dong, Guo Chen, Jueyou Li, Zhi-You Wu
Publication date: 1 July 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9826-0
convex optimizationparallel computationsmoothing techniquedual decompositionfast proximal-gradient method
Related Items (9)
Incremental gradient-free method for nonsmooth distributed optimization ⋮ Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ Distributed convex optimization with coupling constraints over time-varying directed graphs ⋮ Proximal primal-dual best approximation algorithm with memory ⋮ Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks ⋮ A fully distributed ADMM-based dispatch approach for virtual power plant problems ⋮ An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs ⋮ A dual Bregman proximal gradient method for relatively-strongly convex optimization
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Interior-point Lagrangian decomposition method for separable convex optimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Introductory lectures on convex optimization. A basic course.
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- Gradient-free method for nonsmooth distributed optimization
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- Fast Multiple-Splitting Algorithms for Convex Optimization
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- A First-Order Smoothed Penalty Method for Compressed Sensing
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS
- Unnamed Item
- Unnamed Item
This page was built for publication: A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
