DocumentCode
585207
Title
Semidefinite programming methods for min-max robust parameter design
Author
Bhatt, S. ; Mukhopadhyay, S. ; Mulla, A. ; Chakraborty, D.
Author_Institution
Dept. of Electr. Eng., Indian Inst. of Technol. Bombay, Mumbai, India
fYear
2012
fDate
10-12 Sept. 2012
Firstpage
1
Lastpage
5
Abstract
A min-max re-formulation of the robust parameter design problem was introduced in [S. Mukhopadhyay and D. Chakraborty, "A computational algorithm for selecting robust designs in safety and quality critical processes," Sankhya B, 73, May 2011]. This formulation poses a computationally challenging problem: that of finding the min-max value of a polynomial in several variables. It has been recently shown that such an infinite min-max optimization can be solved using semi-definite programming techniques. In this article, a new semi-definite programming algorithm is proposed for solving the min-max formulation of the robust parameter design problem.
Keywords
Taguchi methods; mathematical programming; minimax techniques; polynomials; quality management; computationally challenging problem; infinite min-max optimization; min-max re-formulation; min-max robust parameter design; semidefinite programming methods; semidefinite programming techniques; Algorithm design and analysis; Noise; Optimization; Polynomials; Programming; Robustness; Safety;
fLanguage
English
Publisher
ieee
Conference_Titel
Statistics in Science, Business, and Engineering (ICSSBE), 2012 International Conference on
Conference_Location
Langkawi
Print_ISBN
978-1-4673-1581-4
Type
conf
DOI
10.1109/ICSSBE.2012.6396614
Filename
6396614
Link To Document