19 research outputs found
Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: The single and multi-segment polynomial B-spline approach
International audienc
Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
Bernstein polynomials, Constrained global optimization, Subdivision, Pruning,
Robust controller and pre-filter design using QFT and interval constraint techniques
International audienceno abstrac
Simultaneous automated design of structured QFT controller and prefilter using nonlinear programming
International audienc