| Files Posted by Emile |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 28 Mar 2012 |
|
Illustration of LTI norms: H2 and Hinf Gives several classical ways to compute the H2 and Hinf norms, and illustrates the (non-)smoothness.
Author: Emile Simon |
norm, h2, hinf, nonsmooth, lti systems |
4 |
0 |
|
| 25 Mar 2012 |
|
A direct search method instead of a coordinate descent iterative LMI algorithm Illustrates on an example the efficiency of using a direct search method (instead of an ILMI).
Author: Emile Simon |
optimization algorith..., systems and control |
6 |
3 |
|
| 18 Oct 2011 |
|
Improving the convergence of Nelder-Mead (and so fminsearch) This highlights a (common) trick to improve the convergence of NM, and a problem within fminsearch.
Author: Emile Simon |
optimization, neldermead, restart, algorithm, convergence, benchmark |
17 |
0 |
|
| 04 Oct 2011 |
|
Minimum settling time control design through direct search optimization methods New approach for designing controllers explicitely minimizing the settling time of a time response.
Author: Emile Simon |
optimization, control design, settling time, direct search methods, simulations, time response shaping... |
9 |
4 |
|
| Files Tagged by Emile |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 28 Mar 2012 |
|
Illustration of LTI norms: H2 and Hinf Gives several classical ways to compute the H2 and Hinf norms, and illustrates the (non-)smoothness.
Author: Emile Simon |
norm, h2, hinf, nonsmooth, lti systems |
4 |
0 |
|
| 25 Mar 2012 |
|
A direct search method instead of a coordinate descent iterative LMI algorithm Illustrates on an example the efficiency of using a direct search method (instead of an ILMI).
Author: Emile Simon |
optimization algorith..., systems and control |
6 |
3 |
|
| 18 Oct 2011 |
|
Improving the convergence of Nelder-Mead (and so fminsearch) This highlights a (common) trick to improve the convergence of NM, and a problem within fminsearch.
Author: Emile Simon |
optimization, neldermead, restart, algorithm, convergence, benchmark |
17 |
0 |
|
| 04 Oct 2011 |
|
Minimum settling time control design through direct search optimization methods New approach for designing controllers explicitely minimizing the settling time of a time response.
Author: Emile Simon |
optimization, control design, settling time, direct search methods, simulations, time response shaping... |
9 |
4 |
|
| Files Matching Emile's Watch List |
View all
|
| Updated |
|
File |
Tags |
Downloads (last 30 days) |
Comments |
Rating |
| 25 Mar 2012 |
|
A direct search method instead of a coordinate descent iterative LMI algorithm Illustrates on an example the efficiency of using a direct search method (instead of an ILMI).
Author: Emile Simon |
optimization algorith..., systems and control |
6 |
3 |
|
| 18 Oct 2011 |
|
Improving the convergence of Nelder-Mead (and so fminsearch) This highlights a (common) trick to improve the convergence of NM, and a problem within fminsearch.
Author: Emile Simon |
optimization, neldermead, restart, algorithm, convergence, benchmark |
17 |
0 |
|
| 04 Oct 2011 |
|
Minimum settling time control design through direct search optimization methods New approach for designing controllers explicitely minimizing the settling time of a time response.
Author: Emile Simon |
optimization, control design, settling time, direct search methods, simulations, time response shaping... |
9 |
4 |
|
|
Comment only