Search Results for author:
Found 2 papers, 0 papers with code
Exact Worst-Case Execution-Time Analysis for Implicit Model Predictive Control
For such solvers, we leverage a previously proposed complexity certification framework to generate a finite set of archetypal optimization problems; we prove that these archetypal problems form an execution-time equivalent cover of all possible problems; that is, that they capture the execution time for solving any possible optimization problem that can be encountered online.
Overall Complexity Certification of a Standard Branch and Bound Method for Mixed-Integer Quadratic Programming
With the algorithm proposed in this paper, a total worst-case number of QP iterations to be performed in order to solve the MIQP problem can be determined as a function of the parameter in the problem.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
