2013Unpublished venueRequires access

Advanced Robust Optimization Approach for Design Optimization With Interval Uncertainty Using Sequential Quadratic Programming

Jianhua Zhou, Mian Li

Open publisher page 1 citations

Abstract

Uncertainty is inevitable in real world. It has to be taken into consideration, especially in engineering optimization; otherwise the obtained optimal solution may become infeasible. Robust optimization (RO) approaches have been proposed to deal with this issue. Most existing RO algorithms use double-looped structures in which a large amount of computational efforts have been spent in the inner loop optimization to determine the robustness of candidate solutions. In this paper, an advanced approach is presented where no optimization run is required to be performed for robustness evaluations in the inner loop. Instead, a concept of Utopian point is proposed and the corresponding maximum variable/parameter variation will be obtained by just solving a set of linear equations. The obtained robust optimal solution from the new approach may be conservative, but the deviation from the true robust optimal solution is very small given the significant improvement in the computational efficiency. Six numerical and engineering examples are tested to show the applicability and efficiency of the proposed approach, whose solutions and computational time are compared with those from a similar but double-looped approach, SQP-RO, proposed previously.

About this research paper

What this paper is about

Uncertainty is inevitable in real world. It has to be taken into consideration, especially in engineering optimization; otherwise the obtained optimal solution may become infeasible. Robust optimization (RO) approaches have been proposed to deal with this issue. Most existing RO algorithms use double-looped structures in which a large amount of computational efforts have been spent in the inner loop optimization to determine the robustness of candidate solutions. In this paper, an advanced approach is presented where no optimization run is required to be performed for robustness evaluations in the inner loop. Instead, a concept of Utopian point is proposed and the corresponding maximum variable/parameter variation will be obtained by just solving a set of linear equations. The obtained robust optimal solution from the new approach may be conservative, but the deviation from the true robust optimal solution is very small given the significant improvement in the computational efficiency. Six numerical and engineering examples are tested to show the applicability and efficiency of the proposed approach, whose solutions and computational time are compared with those from a similar but double-looped approach, SQP-RO, proposed previously.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Uncertainty is inevitable in real world. It has to be taken into consideration, especially in engineering optimization; otherwise the obtained optimal solution may become infeasible. Robust optimization (RO) approaches have been proposed to deal with this issue. Most existing RO algorithms use double-looped structures in which a large amount of computational efforts have been spent in the inner loop optimization to determine the robustness of candidate solutions. In this paper, an advanced approach is presented where no optimization run is required to be performed for robustness evaluations in the inner loop. Instead, a concept of Utopian point is proposed and the corresponding maximum variable/parameter variation will be obtained by just solving a set of linear equations. The obtained robust optimal solution from the new approach may be conservative, but the deviation from the true robust optimal solution is very small given the significant improvement in the computational efficiency. Six numerical and engineering examples are tested to show the applicability and efficiency of the proposed approach, whose solutions and computational time are compared with those from a similar but double-looped approach, SQP-RO, proposed previously.

Key concepts: Sequential quadratic programming, Robustness (evolution), Mathematical optimization, Robust optimization, Quadratic programming, Optimization problem, Computer science, Interval (graph theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
Advanced Robust Optimization Approach for Design Optimization With Interval Uncertainty Using Sequential Quadratic Programming — Research Paper | ScholarLens