Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods
From MaRDI portal
Publication:2834559
DOI10.1137/15M1008956zbMath1356.90107arXiv1502.06368OpenAlexW1569740721MaRDI QIDQ2834559
No author found.
Publication date: 23 November 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.06368
Related Items (2)
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent ⋮ Primal recovery from consensus-based dual decomposition for distributed convex optimization
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- Introductory lectures on convex optimization. A basic course.
- Ergodic, primal convergence in dual subgradient schemes for convex programming
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- Multiuser Optimization: Distributed Algorithms and Error Analysis
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods
