Using QR Decomposition to Obtain a New Instance of Mesh Adaptive Direct Search with Uniformly Distributed Polling Directions

Author： Dyke Benjamin Asaki Thomas

Publisher： Springer Publishing Company

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.159, Iss.3, 2013-12, pp. : 805-821

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

Adaptive Mesh and Algorithm Refinement Using Direct Simulation Monte Carlo

By Garcia A.L. Bell J.B. Crutchfield W.Y. Alder B.J.

Journal of Computational Physics, Vol. 154, Iss. 1, 1999-09 ,pp. : 134-155

Academic Press

Access to resources Recommend Favorite

Use of quadratic models with mesh-adaptive direct search for constrained black box optimization

By Conn Andrew R. Le Digabel Sébastien

Optimization Methods and Software, Vol. 28, Iss. 1, 2013-02 ,pp. : 139-158

Taylor & Francis Ltd

Access to resources Recommend Favorite

A QR Decomposition for Matrix Pencils

By Spellucci P.

Bit Numerical Mathematics, Vol. 40, Iss. 1, 2000-01 ,pp. : 183-189

Springer Publishing Company

Access to resources Recommend Favorite

Aspects of adaptive mesh generation based on domain decomposition and Delaunay triangulation

By Lewis R.W. Zheng Y. Usmani A.S.

Finite Elements in Analysis and Design, Vol. 20, Iss. 1, 1995-05 ,pp. : 47-70

Elsevier

Access to resources Recommend Favorite

Adaptive mesh generation using a normal offsetting technique

By Sullivan J.M. Zhang J.Q.

Finite Elements in Analysis and Design, Vol. 25, Iss. 3, 1997-04 ,pp. : 275-295

Elsevier

Access to resources Recommend Favorite