A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
From MaRDI portal
Publication:301677
DOI10.1007/S10589-016-9826-0zbMATH Open1352.90071OpenAlexW2297927615MaRDI QIDQ301677FDOQ301677
Authors: Jueyou Li, Guo Chen, Zhaoyang Dong, Zhiyou 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
Recommendations
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- A fast dual gradient method for separable convex optimization via smoothing
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- A fast dual proximal gradient algorithm for convex minimization and applications
- A splitting method for separable convex programming
convex optimizationdual decompositionparallel computationfast proximal-gradient methodsmoothing technique
Cites Work
- NESTA: A fast and accurate first-order method for sparse recovery
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Smooth minimization of non-smooth functions
- Introductory lectures on convex optimization. A basic course.
- A proximal-based deomposition method for compositions method for convex minimization problems
- Gradient-free method for nonsmooth distributed optimization
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- A first-order smoothed penalty method for compressed sensing
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Title not available (Why is that?)
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Alternating direction method with Gaussian back substitution for separable convex programming
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- Fast multiple-splitting algorithms for convex optimization
- Double smoothing technique for large-scale linearly constrained convex optimization
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
- 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
Cited In (14)
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- A fast dual gradient method for separable convex optimization via smoothing
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Proximal primal-dual best approximation algorithm with memory
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- A fully distributed ADMM-based dispatch approach for virtual power plant problems
- Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks
- Incremental gradient-free method for nonsmooth distributed optimization
- Double smoothing technique for large-scale linearly constrained convex optimization
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- Inexact alternating direction methods of multipliers for separable convex optimization
- Title not available (Why is that?)
Uses Software
This page was built for publication: A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301677)
