Linear complementarity model predictive control with limited iterations for box-constrained problems
From MaRDI portal
Publication:2663927
DOI10.1016/J.AUTOMATICA.2020.109429zbMath1461.93134OpenAlexW3118706735MaRDI QIDQ2663927
Publication date: 20 April 2021
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2020.109429
Quadratic programming (90C20) Linear systems in control theory (93C05) Model predictive control (93B45)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Computational complexity certification for dual gradient method: application to embedded MPC
- Generalizations of the hidden Minkowski property
- A continuation/GMRES method for fast computation of nonlinear receding horizon control
- A framework for multivariable algebraic loops in linear anti-windup implementations
- Complexity and convergence certification of a block principal pivoting method for box-constrained quadratic programs
- A class of polynomially solvable linear complementarity problems
- Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
- Exact Complexity Certification of Active-Set Methods for Quadratic Programming
- A novel fast model predictive control for large-scale structures
- Constrained generalized predictive control
- Computational Complexity Certification for Real-Time MPC With Input Constraints Based on the Fast Gradient Method
- The explicit linear quadratic regulator for constrained systems
This page was built for publication: Linear complementarity model predictive control with limited iterations for box-constrained problems
