Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms

Details Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms

2011-10-12

arxiv.org/abs/1110.2615v3

Mathematics

Optimization and Control

3 pages. Main experimental results reproducible from files available on http://www.mathworks.com/matlabcentral/fileexchange/33

Scientific paper

In this note we aim at putting more emphasis on the fact that trying to solve non-convex optimization problems with coordinate-descent iterative linear matrix inequality algorithms leads to suboptimal solutions, and put forward other optimization methods better equipped to deal with such problems (having theoretical convergence guarantees and/or being more efficient in practice). This fact, already outlined at several places in the literature, still appears to be disregarded by a sizable part of the systems and control community. Thus, main elements on this issue and better optimization alternatives are presented and illustrated by means of an example.

Affiliated with

Also associated with

No associations

Rating

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-633602