.png){kind=icon}
Return
An effective nonlinear interval sequential quadratic programming method for uncertain inverse problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.istruc.2023.03.007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An effective nonlinear interval sequential quadratic programming method is proposed to provide an efficient tool for uncertain inverse problems. Assisted by the ideology of sequential quadratic programming and dimension -reduction analysis theory, the interval inverse problem is transformed into several interval arithmetic and deterministic optimizations, which could enhance computational efficiency without losing much accuracy. The novelty of the proposed method lies in two main aspects. First, an alternate updating strategy is proposed to identify the radii and midpoints of the interval inputs in each cycle, which could reduce the number of iterative steps. Second, the standard quadratic models are constructed based on the dimension-reduction analysis results, rather than the second-order Taylor expansion. Therefore, the interval arithmetic can be applied to efficiently calculate the interval response, which avoids the inner optimization. Moreover, a novel iterative mechanism is developed to accelerate the convergence rate of the proposed method. Finally, two numerical examples and an engineering application are adopted to verify its feasibility, accuracy and efficiency.
Keywords:
Uncertain inverse problem
Interval model
Sequential quadratic programming
Dimension -reduction analysis
Journal
IF:
4.3
Papers:
1.3W
Citations:
2.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveDimensionality reduction and polynomial chaos acceleration of Bayesian inference in inverse problems
OAAI
OAAIShareSave
View more