Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
From MaRDI portal
Publication:2983168
DOI10.1109/TAC.2013.2294614zbMath1360.90205MaRDI QIDQ2983168
Publication date: 16 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Related Items (30)
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent ⋮ Inexact coordinate descent: complexity and preconditioning ⋮ Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds ⋮ Distributed Model Predictive Control of linear discrete-time systems with local and global constraints ⋮ First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems ⋮ Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches ⋮ Computational complexity certification for dual gradient method: application to embedded MPC ⋮ On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems ⋮ Metric selection in fast dual forward-backward splitting ⋮ Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks ⋮ Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization ⋮ An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems ⋮ Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems ⋮ Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming ⋮ Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming ⋮ Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization ⋮ A Simple Parallel Algorithm with an $O(1/t)$ Convergence Rate for General Convex Programs ⋮ An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization ⋮ Unnamed Item ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC ⋮ Iteration complexity analysis of dual first-order methods for conic convex programming ⋮ Real-time model predictive control based on dual gradient projection: Theory and fixed-point FPGA implementation ⋮ Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods ⋮ Distributed coordination for nonsmooth convex optimization via saddle-point dynamics ⋮ Convergence Analysis of Inexact Randomized Iterative Methods ⋮ Decentralized convex optimization under affine constraints for power systems control ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints ⋮ Primal recovery from consensus-based dual decomposition for distributed convex optimization
This page was built for publication: Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
