Open Access
An Efficient Algorithm for Multiparametric Quadratic Programming
Mato Baotić
- 01 Jan 2002
38
About: The article was published on 01 Jan 2002. and is currently open access. The article focuses on the topics: Quadratic programming.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multiparametric Linear Complementarity Problems
Colin N. Jones,Manfred Morrari +1 more
- 01 Dec 2006
TL;DR: This paper presents an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that are defined by positive semi-definite matrices and demonstrates that the proposed algorithm is equal in efficiency to the best of current pLP and pQP solvers.
Multiparametric linear programming with applications to control
TL;DR: In this article, the authors survey recent work on parametric linear programming from the point of view of the control engineer and identify three types of algorithms, two arising from standard convex hull paradigms and one from a geometric intuition, and classify all currently proposed methods under these headings.
67
A Multiparametric Quadratic Programming Algorithm With Polyhedral Computations Based on Nonnegative Least Squares
TL;DR: The approach proposed in this paper relies on a nonnegative least squares (NNLS) solver that is very simple to code and fast to execute and exploits QP duality to identify and construct critical regions and to handle degeneracy issues.
65
A New Methodology for the General Multiparametric Mixed-Integer Linear Programming (MILP) Problems
TL;DR: In this article, a general algorithm is developed to address the multiparametric mixed-integer linear programming (mpMILP) problem with uncertain parameters in the left-hand side (LHS), right-hand si...
56
Combinatorial Approach Toward Multiparametric Quadratic Programming Based on Characterizing Adjacent Critical Regions
TL;DR: Simulation results confirm the reliability of the suggested method in finding the complete solution to the mpQPs while decreasing the computational time compared favorably with the best alternative approaches.