Computational complexity certification for dual gradient method: application to embedded MPC
DOI10.1016/J.SYSCONLE.2015.04.011zbMATH Open1330.49033OpenAlexW929521247MaRDI QIDQ894005FDOQ894005
Authors: Ion Necoara 
Publication date: 23 November 2015
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2015.04.011
Recommendations
- Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
- Convergence analysis of approximate primal solutions in dual first-order methods
- Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Iteration complexity analysis of dual first-order methods for conic convex programming
complexity certificationdual gradientembedded model predictive controllinear/sublinear convergence rate
Complexity and performance of numerical algorithms (65Y20) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Variational Analysis
- Introductory lectures on convex optimization. A basic course.
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
- Application of interior-point methods to model predictive control
- Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method
- Interior-point Lagrangian decomposition method for separable convex optimization
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- An auto-generated real-time iteration algorithm for nonlinear MPC in the microsecond range
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
Cited In (9)
- A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
- Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Linear complementarity model predictive control with limited iterations for box-constrained problems
- Real-time model predictive control based on dual gradient projection: theory and fixed-point FPGA implementation
- Local Decay of Residuals in Dual Gradient Method with Soft State Constraints
- Complexity Certification of the Fast Alternating Minimization Algorithm for Linear MPC
This page was built for publication: Computational complexity certification for dual gradient method: application to embedded MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894005)
