Implementable Algorithm for Stochastic Optimization Using Sample Average Approximations
MetadataShow full item record
We develop an implementable algorithm for stochastic optimization problems involving probability functions. Such problems arise in the design of structural and mechanical systems. The algorithm consists of a nonlinear optimization algorithm applied to sample average approximations and a precision-adjustment rule. The sample average approximations are constructed using Monte Carlo simulations or importance sampling techniques. We prove that the algorithm converges to a solution with probability one and illustrate its use by an example involving a reliability-based optimal design.
Showing items related by title, author, creator and subject.
Rhoden, Christopher A. (Monterey, California. Naval Postgraduate School, 1994-06);The Simplex algorithm, developed by George B. Dantzig in 1947 represents a quantum leap in the ability of applied scientists to solve complicated linear optimization problems. Subsequently, its utility in solving finite ...
Taylor, James G.; Neta, Beny (Monterey, California. Naval Postgraduate School, 2001-09); NPS-MA-01-001The goal of this study effort was to assess the ability of the Joint Conflict and Tactical Simulation (JCATS) to simulate the capabilities of non- lethal weapons (NLW) and to provide a product that can be incorporated into ...
De Kooter, Peter M. (Monterey, California. Naval Postgraduate School, 1997-03);As part of the existing acoustic transient localization program, a feasibility study was performed to apply existing algorithms to signals at higher carrier frequencies. The coherent matching, autocorrelation matching and ...