A Comparison of Nonsmooth, Nonconvex, Constrained Optimization Solvers for the Design of Time-Delay Compensators

arXiv: Optimization and Control(2018)

引用 23|浏览6
暂无评分
摘要
We present a detailed set of performance comparisons of two state-of-the-art solvers for the application of designing time-delay compensators, an important problem in the field of robust control. Formulating such robust control mechanics as constrained optimization problems often involves objective and constraint functions that are both nonconvex and nonsmooth, both of which present significant challenges to many solvers and their end-users hoping to obtain good solutions to these problems. In our particular engineering task, the main difficulty in the optimization arises in a nonsmooth and nonconvex stability constraint, which states that the infinite spectrum of zeros of the so-called shaper should remain in the open left half-plane. To perform our evaluation, we make use $beta$-relative minimization profiles, recently introduced visualization tools that are particularly suited for benchmarking solvers on nonsmooth, nonconvex, constrained optimization problems. Furthermore, we also introduce new visualization tools, called Global-Local Profiles, which for a given problem and a fixed computational budget, assess the tradeoffs of distributing the budget over few or many starting points, with the former getting more budget per point and latter less.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要