• Corpus ID: 6158729

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms

@article{Simon2011AlternativesWS,
  title={Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms},
  author={Emile Simon and Vincent Wertz},
  journal={arXiv: Optimization and Control},
  year={2011}
}
  • E. Simon, V. Wertz
  • Published 12 October 2011
  • Computer Science
  • arXiv: Optimization and Control
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… 

Alternatives for optimization in systems and control: convex and non-convex approaches

TLDR
This presentation develops a short overview of main trends of optimization in systems and control, and outlines some new perspectives emerging today, where it is clear that convex and Linear Matrix Inequality methods have become the most common option.

A perspective for optimization in systems and control : from LMIs to derivative-free methods

TLDR
This investigation is motivated by the fact that this framework is currently largely dominated by LMIs and convex optimization approaches even when the underlying problems are non-convex, in which case other optimization alternatives than convexity-based methods may often be more adequate.

Preliminary Design of Control Surfaces and Laws for Unconventional Aircraft Configurations

Next generation of civil transport aircraft is likely to be a radical change in overall configuration compared to traditional tube-and-wing design. From a handling qualities perspective, current

References

SHOWING 1-10 OF 27 REFERENCES

Solving static output feedback problems by direct search optimization

  • D. Henrion
  • Computer Science
    2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control
  • 2006
TLDR
Numerical experiments are reported showing that with these routines a non-expert user can solve at moderate cost most of the static output feedback design problems available in the problem library COMPleib.

Combining Convex–Concave Decompositions and Linearization Approaches for Solving BMIs, With Application to Static Output Feedback

TLDR
A novel optimization method is proposed to minimize a convex function subject to bilinear matrix inequality (BMI) constraints to applications to various output feedback controller synthesis problems.

A perspective for optimization in systems and control : from LMIs to derivative-free methods

TLDR
This investigation is motivated by the fact that this framework is currently largely dominated by LMIs and convex optimization approaches even when the underlying problems are non-convex, in which case other optimization alternatives than convexity-based methods may often be more adequate.

Convergence Results for Pattern Search Algorithms are Tight

TLDR
Three small dimensioned examples are presented showing that second order optimality conditions cannot be guaranteed and that even under the stronger assumptions of the unconstrained case, there can be innnitely many accumulation points.

Stabilization via Nonsmooth, Nonconvex Optimization

TLDR
Although the focus of the paper is stabilization, once a stabilizing controller is obtained, the same computational techniques can be used to optimize various measures of the closed loop system, including its complex stability radius or Hinfin performance.

Nonsmooth$H_infty$Synthesis

  • P. ApkarianD. Noll
  • Computer Science, Mathematics
    IEEE Transactions on Automatic Control
  • 2006
We develop nonsmooth optimization techniques to solve$H_infty$synthesis problems under additional structural constraints on the controller. Our approach avoids the use of Lyapunov variables and

Controller Design via Nonsmooth Multi-Directional Search

Coordinate optimization for bi-convex matrix inequalities

  • J. HeltonO. Merino
  • Computer Science
    Proceedings of the 36th IEEE Conference on Decision and Control
  • 1997
TLDR
There is strong evidence in this article that on "well behaved /spl Gamma/" coordinate optimization always gives a local optimum for the min/sub Y/ max/sub X/ problem and that it almost never gives aLocal solution to the min-sub Y-max-sub X- problem.

Mesh Adaptive Direct Search Algorithms for Constrained Optimization

TLDR
The main result of this paper is that the general MADS framework is flexible enough to allow the generation of an asymptotically dense set of refining directions along which the Clarke derivatives are nonnegative.

ON THE CONVERGENCE OF PATTERN SEARCH ALGORITHMS

TLDR
The characterization of pattern search methods is exploited to establish a global convergence theory that does not enforce a notion of sufficient decrease, and is possible because the iterates of a pattern search method lie on a scaled, translated integer lattice.