Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
From MaRDI portal
Publication:5173274
Abstract: We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the relaxation of complicating constraints with gradient and fast gradient methods based on inexact first order information. Moreover, since the exact solution of the augmented Lagrangian primal problem is hard to compute in practice, we solve this problem up to some given inner accuracy. We derive relations between the inner and the outer accuracy of the primal and dual problems and we give a full convergence rate analysis for both gradient and fast gradient algorithms. We provide estimates on the primal and dual suboptimality and on primal feasibility violation of the generated approximate primal and dual solutions. Our analysis relies on the Lipschitz property of the dual function and on inexact dual gradients. We also discuss implementation aspects of the proposed algorithms on constrained model predictive control problems for embedded linear systems.
Recommendations
- Computational complexity certification for dual gradient method: application to embedded MPC
- Complexity certifications of first-order inexact Lagrangian methods for general convex programming: application to real-time MPC
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
Cited in
(36)- A dual gradient-projection algorithm for model predictive control in fixed-point arithmetic
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- General convergence analysis of stochastic first-order methods for composite optimization
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
- Augmented Lagrangian optimization under fixed-point arithmetic
- Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
- An adaptive primal-dual framework for nonsmooth convex minimization
- A software framework for embedded nonlinear model predictive control using a gradient-based augmented Lagrangian approach (GRAMPC)
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Distributed model predictive control method for optimal coordination of signal splits in urban traffic networks
- 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
- Convergence analysis of approximate primal solutions in dual first-order methods
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
- Adaptive smoothing algorithms for nonsmooth composite convex minimization
- An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization
- A linear algebra perspective on the random multi-block ADMM: the QP case
- Convergence of the projection and contraction methods for solving bilevel variational inequality problems
- Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization
- Mini-batch stochastic subgradient for functional constrained optimization
- Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
- A stochastic moving ball approximation method for smooth convex constrained minimization
- An inexact linearized augmented Lagrangian method for the linearly composite convex programming
- Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
- Global convergence analysis of the power proximal point and augmented Lagrangian method
- A smoothed augmented Lagrangian framework for convex optimization with nonsmooth constraints
- A balanced augmented Lagrangian method with correction for linearly constrained optimization
- Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming
- A new inexact gradient descent method with applications to nonsmooth convex optimization
- The augmented Lagrangian methods: overview and recent advances
- Computational complexity certification for dual gradient method: application to embedded MPC
- Optimal move blocking strategies for model predictive control
- Metric selection in fast dual forward-backward splitting
This page was built for publication: Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173274)
