The main idea in this paper is to implement a distributed primal-dual interior-point algorithm for loosely coupled Quadratic Programming problems. We implement this in Julia and show how can we exploit parallelism in order to increase the computational speed. We investigate the performance of the algorithm on a Model Predictive Control problem.
In this paper we show that chordal structure can be used to devise efficient optimization methods for robust model predictive control problems. To this end, first the problem is converted to an equivalent robust quadratic programming formulation. We then illustrate how the chordal structure can be used to distribute the computations in a primal-dual interior-point method among computational agents, which in turn allows us to accelerate the algorithm by efficient parallel computations. We investigate performance of the framework in Julia using numerical examples.
This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic constraints. This approach yields a sparse linear matrix inequality which can be decomposed into a set of smaller, coupled linear matrix inequalities. This allows us to solve the analysis problem efficiently and in a distributed manner. We also show that the decomposed problem is equivalent to the original robustness analysis problem, and hence our method does not introduce additional conservativeness.
We propose a new method for generating semidefinite relaxations of optimal power flow problems. The method is based on chordal conversion techniques: by dropping some equality constraints in the conversion, we obtain semidefinite relaxations that are computationally cheaper, but potentially weaker, than the standard semidefinite relaxation. Our numerical results show that the new relaxations often produce the same results as the standard semidefinite relaxation, but at a lower computational cost.
In this paper, we consider robust stability analysis of large-scale sparsely interconnected uncertain systems. By modeling the interconnections among the subsystems with integral quadratic constraints, we show that robust stability analysis of such systems can be performed by solving a set of sparse linear matrix inequalities. We also show that a sparse formulation of the analysis problem is equivalent to the classical formulation of the robustness analysis problem and hence does not introduce any additional conservativeness. The sparse formulation of the analysis problem allows us to apply methods that rely on efficient sparse factorization techniques, and our numerical results illustrate the effectiveness of this approach compared to methods that are based on the standard formulation of the analysis problem.
When designing robust controllers, H-infinity synthesis is a common tool touse. The controllers that result from these algorithms are typically of very high order, which complicates implementation. However, if a constraint on the maximum order of the controller is set, that is lower than the order of the (augmented) system, the problem becomes nonconvex and it is relatively hard to solve. These problems become very complex, even when the order of the system is low.
The approach used in this work is based on formulating the constraint onthe maximum order of the controller as a polynomial (or rational) equation.This equality constraint is added to the optimization problem of minimizingan upper bound on the H-innity norm of the closed loop system subjectto linear matrix inequality (LMI) constraints. The problem is then solvedby reformulating it as a partially augmented Lagrangian problem where theequality constraint is put into the objective function, but where the LMIsare kept as constraints.
The proposed method is evaluated together with two well-known methodsfrom the literature. The results indicate that the proposed method hascomparable performance in most cases, especially if the synthesized con-troller has many parameters, which is the case if the system to be controlledhas many input and output signals.
This technical note proposes a method for low order H-infinity synthesis where the constraint on the order of the controller is formulated as a rational equation. The resulting nonconvex optimization problem is then solved by applying a partially augmented Lagrangian method. The proposed method is evaluated together with two well-known methods from the literature. The results indicate that the proposed method has comparable performance and speed.
When designing robust controllers, H-infinity synthesis is a common tool to use. The controllers that result from these algorithms are typically of very high order, which complicates implementation. However, if a constraint on the maximum order of the controller is set, that is lower than the order of the (augmented) system, the problem becomes nonconvex and it is relatively hard to solve. These problems become very complex, even when the order of the system is low.
The approach used in this work is based on formulating the constraint on the maximum order of the controller as a polynomial (or rational) equation. By using the fact that the polynomial (or rational) is non-negative on the feasible set, the problem is reformulated as an optimization problem where the nonconvex function is to be minimized over a convex set defined by linear matrix inequalities.
The proposed method is evaluated together with a well-known method from the literature. The results indicate that the proposed method performs slightly better.
When designing robust controllers, H-infinity synthesisis a common tool to use. The controllers that result from these algorithms are typically of very high order, which complicates implementation. However, if a constraint on the maximum order of the controller is set, that is lower than the order of the (augmented) system, the problem becomes nonconvex and it is relatively hard to solve. These problems become very complex,even when the order of the system is low.
The proposed method is evaluated together with a wellknown method from the literature. The results indicate that the proposed method performs slightly better.
This technical note proposes a method for low order H-infinity synthesis where the constraint on the order of the controller is formulated as a rational equation. The resulting nonconvex optimization problem is then solved by applying a quasi-Newton primal-dual interior point method. The proposed method is evaluated together with a well-known method from the literature. The results indicate that the proposed method has comparable performance and speed.
Here we present numerical results and timings obtained using our quasi-Newton interior point method on a set of 44 systems. We were not able to include these results in the article due to limited amount of space. Also results from our evaluation of HIFOO on the same systems are included.
An approach to model reduction of LTI systems using Linear Matrix Inequalities (LMIs) in an H-infinity framework is presented, where non-convex constraints are replaced with stricter convex constraints thus making it suboptimal. The presented algorithms are compared with the Optimal Hankel reduction algorithm, and are shown to achieve better results (i.elower H-infinity errors) in cases where some of the Hankel singular values are close, but not equal to each other.
The task of generating time optimal trajectories for a six degrees of freedom industrial robot is discussed and an existing convex optimization formulation of the problem is extended to include new types of constraints. The new constraints are speed dependent and can be motivated from physical modeling of the motors and the drive system. It is shown how the speed dependent constraints should be added in order to keep the convexity of the overall problem. A method to, conservatively, approximate the linear speed dependent constraints by a convex constraint is also proposed. A numerical example proves versatility of the extension proposed in this paper.
In this paper a preprocessing algorithm for binary quadratic programming problems is presented. For some types of binary quadratic programming problems, the algorithm can compute the optimal value for some or all integer variables without approximations in polynomial time. When the optimal multiuser detection problem is formulated as a maximum likelihood problem, a binary quadratic programming problem has to be solved. Fortunately, the low correlation between different users in the multiuser detection problem enables the use of the preprocessing algorithm. Simulations show that the preprocessing algorithm is able to compute almost all variables in the problem, even though the system is heavily loaded and affected by noise.
The objective of this work is to derive a Mixed Integer Quadratic Programming algorithm tailored for Model Predictive Control for hybrid systems. The Mixed Integer Quadratic Programming algorithm is built on the branch and bound method, where Quadratic Programming relaxations of the original problem are solved in the nodes of a binary search tree. The difference between these subproblems is often small and therefore it is interesting to be able to use a previous solution as a starting point in a new subproblem. This is referred to as a warm start of the solver. Because of its warm start properties, an algorithm that works similar to an active set method is desired. A drawback with classical active set methods is that they often require many iterations in order to find the active set in optimum. So-called gradient projection methods are known to be able to identify this active set very fast. In the algorithm presented in this report, an algorithm built on gradient projection and projection of a Newton search direction onto the feasible set is used. It is a variant of a previously presented algorithm by the authors and makes it straightforward to utilize the previous result, where it is shown how the Newton search direction for the dual MPC problem can be computed very efficiently using Riccati recursions. As in the previous work, this operation can be performed with linear computational complexity in the prediction horizon. Moreover, the gradient computation used in the gradient projection part of the algorithm is also tailored for the problem in order to decrase the computational complexity. Furthermore, is is shown how a Riccati recursion still can be useful in the case when the system of equations for the ordinary search directino is inconsistent. In numerical experiments, the algorithm shows good performance, and it seems like the gradient projection strategy efficiently cuts down the number of Newton steps necessary to compute in order to reach the solution. When the algorithm is used as a part of an MIQP solver for hybrid MPC, the performance is still very good for small problems. However, for more difficult problems, there still seems to be some more work to do in order to get the performance of the commercial state-of-the-art solver CPLEX.
The objective of this work is to derive a QPalgorithm tailored for MPC. More speciﬁc, the primary targetapplication is MPC for discrete-time hybrid systems. A desiredproperty of the algorithm is that warm starts should be possibleto perform efﬁciently. This property is very important for online linear MPC, and it is crucial in branch and bound forhybrid MPC. In this paper, a dual active set-like QP methodwas chosen because of its warm start properties. A drawbackwith classical active set methods is that they often requiremany iterations in order to ﬁnd the active set in optimum.Gradient projection methods are methods known to be ableto identify this active set very fast and such a method wastherefore chosen in this work. The gradient projection methodwas applied to the dual QP problem and it was tailored for theMPC application. Results from numerical experiments indicatethat the performance of the new algorithm is very good, bothfor linear MPC as well as for hybrid MPC. It is also noticed thatthe number of QP iterations is significantly reduced compared to classical active set methods.
The objective of this work is to derive a QP algorithm tailored for MPC. More specifically, the primary target application is MPC for discrete-time hybrid systems. A desired property of the algorithm is that warm starts should be possible to perform efficiently. This property is very important for on-line linear MPC, and it is crucial in branch and bound for hybrid MPC. In this paper, a dual active set-like QP method was chosen because of its warm start properties. A drawback with classical active set methods is that they often require many iterations in order to find the active set in optimum. Gradient projection methods are methods known to be able to identify this active set very fast and such a method was therefore chosen in this work. The gradient projection method was applied to the dual QP problem and it was tailored for the MPC application. Results from numerical experiments indicate that the performance of the new algorithm is very good, both for linear MPC as well as for hybrid MPC. It is also noticed that the number of QP iterations is significantly reduced compared to classical active set methods.
The objective of this work is to derive an MIQP solver tailored for MPC. The MIQP solver is built on the branch and bound method, where QP relaxations of the original problem are solved in the nodes of a binary search tree. The difference between the subproblems is often small and therefore it is interesting to be able to use a previous solution as a starting point in a new subproblem. This is referred to as a warm start of the solver. Because of its good warm start properties, a dual active set QP method was chosen. The method is tailored for MPC by solving a part of the KKT system using a Riccati recursion, which makes the computational complexity of the QP iterations grow linearly with the prediction horizon. Simulation results are presented both for the QP solver itself and when it is incorporated as a part of the MIQP solver. In both cases the computational complexity is significantly reduced compared to if a primal active set solver not utilizing structure is used.
In this paper a preprocessing algorithm for unconstrained mixed integer quadratic programming problems and binary quadratic programming problems is presented. The algorithm applies to problems with certain properties, which are further described in the paper. When the algorithm is applied to a problem with these properties, the optimal value for some or all integer variables can be computed without approximations in polynomial time. The algorithm is first derived for the binary quadratic programming problem and the result is then extended to the mixed integer quadratic programming problem by transforming the latter problem into the first problem. Both mentioned quadratic programming problems have several important applications. In this paper, the focus is on model predictive control problems with both real-valued and binary control signals. As an illustration of the method, the algorithm is applied to two different problems of this type.
In this paper a preprocessing algorithm for unconstrained mixed integer quadratic programming problems and binary quadratic programming problems is presented. The algorithm applies to problems with certain properties, which are further described in the paper. When the algorithm is applied to a problem with these properties, the optimal value for some or all integer variables can be computed without approximations in polynomial time. The algorithm is first derived for the binary quadratic programming problem and the resultis then extended to the mixed integer quadratic programming problem by transforming the latter problem into the first problem. Both mentioned quadratic programming problems have several important applications. In this paper, the focus is on model predictive control problems with both real-valued and binary control signals. As an illustration of the method, the algorithm is applied to two different problems of this type.
The objective with this work is to derive an MIQP solver tailored for MPC. The MIQP solver is built on the branch and bound method, where QP relaxations of the original problem are solved in the nodes of a binary search tree. The difference between the subproblems is often small and therefore it is interesting to be able to use a previous solution as a starting point in a new subproblem. This is referred to as a warm start of the solver. Because of its good warm start properties, a dual active set QP method was chosen. The method is tailored for MPC by solving a part of the KKT system using a Riccati recursion, which makes the computational complexity of the QP iterations grow linearly with the prediction horizon. Simulation results are presented both for the QP solver itself and when it is incorporated as a part of the MIQP solver. In both cases the computational complexity is significantly reduced compared to if a primal active set solver not utilizing structure is used.
In this chapter parallel implementations of hybrid MPC will be discussed. Different methods for achieving parallelism at different levels of the algorithms will be surveyed. It will be seen that there are many possible ways of obtaining parallelism for hybrid MPC, and it is by no means clear which possibilities that should be utilized to achieve the best possible performance. To answer this question is a challenge for future research.
The optimum multiuser detection problem can be formulated as a maximum likelihood problem, which yields a binary quadratic programming problem to be solved. Generally this problem is NP-hard and is therefore hard to solve in real time. In this paper, a preprocessing algorithm is presented which makes it possible to detect some or all users optimally for a low computational cost if signature sequences with low cross correlation, e.g., Gold sequences, are used. The algorithm can be interpreted as, e.g., an adaptive tradeoff between parallel interference cancellation and successive interference cancellation. Simulations show that the preprocessing algorithm is able to optimally compute more than 94,% of the bits in the problem when the users are time-synchronous, even though the system is heavily loaded and affected by noise. Any remaining bits, not computed by the preprocessing algorithm, can either be computed by a suboptimal detector or an optimal detector. Simulations of the time-synchronous case show that if a suboptimal detector is chosen, the bit error rate (BER) rate is significantly reduced compared with using the suboptimal detector alone.
In this work, different relaxations applicable to an MPC problem with a mix of real valued and binary valued control signals are compared. In the problem description considered, there are linear inequality constraints on states and control signals. The relaxations are related theoretically and both the tightness of the bounds and the computational complexities are compared in numerical experiments. The relaxations considered are the quadratic programming (QP) relaxation, the standard semidefinite programming (SDP) relaxation and an equality constrained SDP relaxation. The result is that the standard SDP relaxation is the one that usually gives the best bound and is most computationally demanding, while the QP relaxation is the one that gives the worst bound and is least computationally demanding. The equality constrained relaxation presented in this paper often gives a better bound than the QP relaxation and is less computationally demanding compared to the standard SDP relaxation. Furthermore, it is also shown how the equality constrained SDP relaxation can be efficiently computed by solving the Newton system in an Interior Point algorithm using a Riccati recursion. This makes it possible to compute the equality constrained relaxation with approximately linear computational complexity in the prediction horizon.
The main objective in this work is to compare different convex relaxations for Model Predictive Control (MPC) problems with mixed real valued and binary valued control signals. In the problem description considered, the objective function is quadratic, the dynamics are linear, and the inequality constraints on states and control signals are all linear. The relaxations are related theoretically and the quality of the bounds and the computational complexities are compared in numerical experiments. The investigated relaxations include the Quadratic Programming (QP) relaxation, the standard Semidefinite Programming (SDP) relaxation, and an equality constrained SDP relaxation. The equality constrained SDP relaxation appears to be new in the context of hybrid MPC and the result presented in this work indicates that it can be useful as an alternative relaxation, which is less computationally demanding than the ordinary SDP relaxation and which often gives a better bound than the bound from the QP relaxation. Furthermore, it is discussed how the result from the SDP relaxations can be used to generate suboptimal solutions to the control problem. Moreover, it is also shown that the equality constrained SDP relaxation is equivalent to a QP in an important special case.
In this work, different relaxations applicable to an MPC problem with binary control signals are compared. The relaxations considered are the QP relaxation, the standard SDP relaxation and an equality constrained SDP relaxation. The relaxations are related theoretically and both the tightness of the bounds and the computational complexities are compared in numerical experiments.The result is that the standard SDP relaxation is the one that usually gives the best bound and is most computationally demanding, while the QP relaxation is the one that gives the worst bound and is least computationally demanding. The equality constrained relaxation presented in this paper often gives a better bound than the QP relaxation and is much less computationally demanding compared to the standard SDP relaxation. Furthermore, for a special case, it is shown that the equality constrained SDP relaxation can be cast in the form of a QP. This makes it possible to replace the ordinary QP relaxation usually used in branch and bound for these problems witha tighter SDP relaxation. Numerical experiments indicate that this relaxation can decrease the overall computational time spent in branch and bound.
In this work, different relaxations applicable to an MPC problem with binary control signals are compared. The relaxations considered are the QP relaxation, the standard SDP relaxation and an alternative equality constrained SDP relaxation. The relaxations are related theoretically, and both the tightness of the bounds and the computational complexities are compared in numerical experiments. The result is that for long prediction horizons, the equality constrained SDP relaxation proposed in this paper provides a good trade-off between the quality of the relaxation and the computational time.
To optimally compensate for time-varying phase aberrations with adaptive optics, a model of the dynamics of the aberrations is required to predict the phase aberration at the next time step. We model the time-varying behavior of a phase aberration, expressed in Zernike modes, by assuming that the temporal dynamics of the Zernike coefficients can be described by a vector-valued autoregressive (VAR) model. We propose an iterative method based on a convex heuristic for a rank-constrained optimization problem, to jointly estimate the parameters of the VAR model and the Zernike coefficients from a time series of measurements of the point-spread function (PSF) of the optical system. By assuming the phase aberration is small, the relation between aberration and PSF measurements can be approximated by a quadratic function. As such, our method is a blind identification method for linear dynamics in a stochastic Wiener system with a quadratic nonlinearity at the output and a phase retrieval method that uses a time-evolution-model constraint and a single image at every time step. (c) 2019 Optical Society of America.
The CDIO (Conceive Design Implement Operate) Initiative is explained, and some of the results at the Applied Physics and Electrical Engineering program at Linköping University, Sweden, are presented. A project course in Automatic Control is used as an example. The projects within the course are carried out using the LIPS (Linköping interactive project steering) model. An example of a project, the golf playing industrial robot, and the results from this project are also covered.
Many control related problems can be cast as semidefinite programs but, even though there exist polynomial time algorithms and good publicly available solvers, the time it takes to solve these problems can be long. Something many of these problems have in common, is that some of the variables enter as matrix valued variables. This leads to a low-rank structure in the basis matrices which can be exploited when forming the Newton equations. In this paper, we describe how this can be done, and show how our code can be used when using SDPT3. The idea behind this is old and is implemented in LMI Lab, but we show that when using a modern algorithm, the computational time can be reduced. Finally, we describe how the modeling language YALMIP is changed in such a way that our code can be interfaced using standard YALMIP commands, which greatly simplifies for the user.
In this paper, a structure exploiting algorithm for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma, where some of the constraints appear as complicating constraints is presented. A decomposition algorithm is proposed, where the structure of the problem can be utilized. In a numerical example, where a controller that minimizes the sum of the H_{2}-norm and the H_{∞}-norm is designed, the algorithm is shown to be faster than SeDuMi and the special purpose solver KYPD.
In this paper, a structure exploiting algorithm for semidefinite programs derived from the Kalmatz-Yakubovich-Popov lemma, where some of the constraints appear as complicating constraints is presented. A decomposition algorithm is proposed, where the structure of the problem can be utilized. In a numerical example, where a controller that minimizes the stun of the H-2-norm and the H-infinity-norm is designed, the algorithm, is shown to be faster than SeDuMi and the special purpose solver KYPD.
Many control-related problems can be cast as semidefinite programs. Even though there exist polynomial time algorithms and excellent publicly available solvers, the time it takes to solve these problems can be excessive. What many of these problems have in common, in particular in control, is that some of the variables enter as matrix-valued variables. This leads to a low-rank structure in the basis matrices which can be exploited when forming the Newton equations. In this article, we describe how this can be done, and show how our code, called STRUL, can be used in conjunction with the semidefinite programming solver SDPT3. The idea behind the structure exploitation is classical and is implemented in LMI Lab, but we show that when using a modern semidefinite programming framework such as SDPT3, the computational time can be significantly reduced. Finally, we describe how the modelling language YALMIP has been changed in such a way that our code, which can be freely downloaded, can be interfaced using standard YALMIP commands. This greatly simplifies modelling and usage.
In many applications, design or analysis is performed over a finite frequency range of interest. The importance of the H_{2}/robust H_{2} norm highlights the necessity of computing this norm accordingly. This paper provides different methods for computing upper bounds on the robust finite-frequency H_{2} norm for systems with structured uncertainties. An application of the robust finite-frequency H_{2} norm for a comfort analysis problem of an aero-elastic model of an aircraft is also presented.
In many applications, design or analysis is performed over a finite-frequency range of interest. The importance of the H_{2} norm highlights the necessity of computing this norm accordingly. This paper provides different methods for computing upper bounds of the robust finite-frequency H_{2} norm for systems with structured uncertainties. An application of the robust finite-frequency H_{2} norm for a comfort analysis problem of an aero-elastic model of an aircraft is also presented.
In this paper is discussed how to efficiently solve semidefinite programs related to the Kalman-Yakubovich-Popov lemma. We consider a potential-reduction method where Nesterov-Todd search directions are computed inexactly by applying a preconditioned conjugate gradient method on the Schur complement equations. An efficient preconditioner based on Lyapunov equations is derived. We give a proof of polynomial convergence for this interior point method.
This paper studies the time-optimal path tracking problem for a cooperative robotic system. The considered system is composed of two two-link planar manipulators with non-actuated end-effectors rigidly grasping a bar. Given a predefined geometric path, the objective is to cooperatively move the bar along the path in minimum time subject to inequality constraints on the joint torques. We show that this problem can be cast as a convex optimization problem by using the existing results for a single manipulator, and also the fact that the desired motion of the bar can be achieved by incorporating its dynamics into the manipulators dynamics. We illustrate our results in simulation. (C) 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
In this paper is discussed how to efficiently solve semidefinite programs related to the Kalman-Yakubovich-Popov lemma. We consider a potential-reduction method where Nesterov-Todd search directions are computed inexactly by applying a preconditioned conjugate gradient method to the Schur complement equation. An efficient preconditioner based on Lyapunov equations is derived. We give a proof of polynomial convergence for this interior point method.