An algorithm for approximate multiparametric convex programming
From MaRDI portal
Publication:853676
DOI10.1007/s10589-006-6447-zzbMath1121.90100MaRDI QIDQ853676
Alberto Bemporad, Carlo Filippi
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-6447-z
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric algorithm for multiparametric linear programming
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- Global optimization with data perturbations
- Computable bounds on parametric solutions of convex problems
- On parametric semidefinite programming
- Suboptimal explicit receding horizon control via approximate multiparametric quadratic pro\-gramming
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Approximate explicit receding horizon control of constrained nonlinear systems.
- An algorithm for approximate multiparametric linear programming
- An algorithm for multi-parametric quadratic programming and explicit MPC solutions
- DC programming: overview.
- Model predictive control. With a foreword by M. J. Grimble and M. A. Johnson
- Computational complexity of parametric linear programming
- Computable error bounds for nonlinear programming
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Model predictive control based on linear programming - the explicit solution
- Inequalities for Stochastic Nonlinear Programming Problems
- The explicit linear quadratic regulator for constrained systems
