Efficient algorithm for computing QFT bounds

ISSN： 1366-5820

Source： International Journal of Control, Vol.83, Iss.4, 2010-04, pp. : 716-723

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

LFTB: An Efficient Algorithm to Bound Linear Fractional Transformations

By D’Amato Fernando Rotea Mario

Optimization and Engineering, Vol. 6, Iss. 2, 2005-06 ,pp. : 177-201

Springer Publishing Company

Access to resources Recommend Favorite

TRIXEL: a simple, efficient algorithm for colour-fill contouring

By Campbell John S. Robinson James

Engineering Computations: Int J for Computer-Aided Engineering, Vol. 5, Iss. 4, 1993-12 ,pp. : 335-341

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

An efficient multiobjective differential evolution algorithm for engineering design

By Gong Wenyin

Structural and Multidisciplinary Optimization, Vol. 38, Iss. 2, 2009-04 ,pp. : 137-157

Springer Publishing Company

Access to resources Recommend Favorite

Efficient computing budget allocation for finding simplest good designs

By Jia Qing-Shan

IIE Transactions, Vol. 45, Iss. 7, 2013-07 ,pp. : 736-750

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient approach for computing optimal low-rank regularized inverse matrices

By Chung Julianne Chung Matthias

Inverse Problems, Vol. 30, Iss. 11, 2014-11 ,pp. : 114009-114027

IOP Publishing

Access to resources Recommend Favorite