Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
From MaRDI portal
Cited in
(35)- 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
- Inexact coordinate descent: complexity and preconditioning
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
- Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
- Distributed Model Predictive Control of linear discrete-time systems with local and global constraints
- Iterative distributed model predictive control for heterogeneous systems with non-convex coupled constraints
- Iterative distributed model predictive control for nonlinear systems with coupled non-convex constraints and costs
- A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
- Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Numerical structure of the Hessian of the Lagrange dual function for a class of convex problems
- Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
- Iteration governor for suboptimal MPC with input constraints
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- Decentralized convex optimization under affine constraints for power systems control
- Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems
- First-order methods for problems with \(O(1)\) functional constraints can have almost the same convergence rate as for unconstrained problems
- Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches
- Computational complexity certification for dual gradient method: application to embedded MPC
- Convergence analysis of approximate primal solutions in dual first-order methods
- On the complexity analysis of the primal solutions for the accelerated randomized dual coordinate ascent
- Convergence analysis of inexact randomized iterative methods
- Real-time model predictive control based on dual gradient projection: theory and fixed-point FPGA implementation
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Metric selection in fast dual forward-backward splitting
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- scientific article; zbMATH DE number 6982986 (Why is no real title available?)
- An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization
This page was built for publication: Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983168)
