On feasible sets for MPC and their approximations
From MaRDI portal
(Redirected from Publication:629062)
Recommendations
- On the Stability of the Feasible Set in Optimization Problems
- An approximation of feasible sets in semi-infinite optimization.
- A fast MPC algorithm using nonfeasible active set methods
- Approximation of reachable sets using optimal control algorithms
- The feasible set in generalized semi-infinite optimization
- On representations of the feasible set in convex optimization
- Large-Scale Scientific Computing
- Optimality of the methods for approximating the feasible criterion set in the convex case
- Robust MPC of constrained discrete-time nonlinear systems based on approximated reachable sets
- On the stability of the feasible set in linear optimization
Cites work
- scientific article; zbMATH DE number 665697 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- An algorithm for approximate multiparametric convex programming
- An algorithm for multi-parametric quadratic programming and explicit MPC solutions
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Approximation of convex sets by polytopes
- Constrained model predictive control: Stability and optimality
- Continuous selection and unique polyhedral representation of solutions to convex parametric quadratic programs
- Dropping a vertex or a facet from a convex polytope
- Linear systems with state and control constraints: the theory and application of maximal output admissible sets
- Linear time approximation of 3D convex polytopes
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- On polyhedral projection and parametric programming
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Polytope Projection and Projection Polytopes
- Set-theoretic methods in control
- The explicit linear quadratic regulator for constrained systems
- Ultimate boundedness control for uncertain discrete-time systems via set-induced Lyapunov functions
Cited in
(15)- Vertical hierarchical MPC for constrained linear systems
- Set operations and order reductions for constrained zonotopes
- Construction of invariant polytopic sets with specified complexity
- Control with constraints for linear stationary systems: an interpolation approach
- Numerical modeling and some optimal control problems of dynamic systems describing contact problems with friction in elasticity
- A fast MPC algorithm using nonfeasible active set methods
- A patchy approximation of explicit model predictive control
- A set-theoretic generalization of dissipativity with applications in tube MPC
- Explicit improved vertex control for uncertain, time-varying linear discrete-time systems with state and control constraints
- Guaranteed feasible control allocation using model predictive control
- From control invariant sets to an inverse optimality perspective on the constrained control design
- Inner-outer approximation of robust control invariant sets
- A parametric characterization of mean-variance efficient solutions for general feasible action sets
- Minimizing setup in broadcast-optimal two round MPC
- A dual-mode framework for lifting-based self-triggered model predictive control of linear systems with a guarantee of minimum triggering in steady state
This page was built for publication: On feasible sets for MPC and their approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q629062)
