A computational algorithm for selecting robust designs in safety and quality critical processes

DOI10.1007/s13571-011-0021-0zbMath1230.62156OpenAlexW2085364459MaRDI QIDQ641802

Juan-Miguel Gracia

Publication date: 25 October 2011

Published in: Sankhyā. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13571-011-0021-0

zbMATH Keywords

optimizationcomputational algorithmscontrol settingcrash testdrug granulationguaranteed quality

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30)

Uses Software

• MCS

Cites Work

• Unnamed Item
• Solving continuous min-max problems by an iterative entropic regularization method.
• An algorithm for the global optimization of a class of continuous minimax problems
• Global optimization by multilevel coordinate search
• Lipschitzian optimization without the Lipschitz constant
• A direct method of linearization for continuous minimax problems
• A semi-parametric approach to robust parameter design
• An interior point algorithm for continuous minimax: implementation and computation
• Smooth Optimization Methods for Minimax Problems
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• Bayesian and maximin optimal designs for heteroscedastic regression models
• An interior point algorithm for computing saddle points of constrained continuous minimax