AIAA JOURNAL Vol. 50, No. 5, May 2012 Provably Convergent Multiﬁdelity Optimization Algorithm Not Requiring High-Fidelity Derivatives Andrew March∗ and Karen Willcox†

First Page		Document Content
Date: 2013-06-19 14:19:05 Mathematics Multidisciplinary design optimization Interpolation Quasi-Newton method Surrogate model Genetic algorithm Maximum likelihood Global optimization Numerical analysis Mathematical optimization Applied mathematics Science		AIAA JOURNAL Vol. 50, No. 5, May 2012 Provably Convergent Multiﬁdelity Optimization Algorithm Not Requiring High-Fidelity Derivatives Andrew March∗ and Karen Willcox† Add to Reading List Source URL: raphael.mit.edu Download Document from Source Website File Size: 1,42 MB Share Document on Facebook

	A Modified Orthant-Wise Limited Memory Quasi-Newton Method Supplementary Material for “A Modified Orthant-Wise Limited Memory Quasi-Newton Method with Convergence Analysis” A. BFGS and L-BFGS For self-containedness, DocID: 1vavi - View Document
	Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade DocID: 1qhO6 - View Document
	SIAM J. SCI. COMPUT. Vol. 36, No. 3, pp. A930–A954 c 2014 Society for Industrial and Applied Mathematics DocID: 1p7r1 - View Document
	A Stochastic Quasi-Newton Method for Online Convex Optimization Nicol N. Schraudolph Jin Yu DocID: 1o0hH - View Document
	A Stochastic Quasi-Newton Method for Online Convex Optimization∗ Nicol N. Schraudolph Jin Yu DocID: 1mHOd - View Document