How to improve computing speed of mincx
1 次查看(过去 30 天)
显示 更早的评论
Hi, I would like to ask you how to improve computing speed of mincx in linear matrix inequality.
As the number of variables increases, it takes longer to solve the linear matrix inequalities with mincx.
So, how can I improve the computing speed?
Or, do you have any ideas on how to use GPU for computing the solution of linear matrix inequality?
0 个评论
回答(1 个)
Angelo Yeo
2024-5-8
-------------------------------------------------------------------------------------
In LMI optimization, the computational overhead per iteration mostly comes from solving a least-squares problem of the form
where x is the vector of decision variables. Two methods are used to solve this problem: Cholesky factorization of (default), and QR factorization of A when the normal equation becomes ill conditioned (when close to the solution typically). The message
* switching to QR
is displayed when the solver has to switch to the QR mode.
Since QR factorization is incrementally more expensive in most problems, it is sometimes desirable to prevent switching to QR. This is done by setting options(4) = 1. While not guaranteed to produce the optimal value, this generally achieves a good trade-off between speed and accuracy.
-------------------------------------------------------------------------------------
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Linear Matrix Inequalities 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!