# American Institute of Mathematical Sciences

• Previous Article
Initial guess sensitivity in computational optimal control problems
• NACO Home
• This Issue
• Next Article
Numerical comparisons of smoothing functions for optimal correction of an infeasible system of absolute value equations
March  2020, 10(1): 23-38. doi: 10.3934/naco.2019030

## Numerical solution of an obstacle problem with interval coefficients

 Department of Mathematics & Statistics, Curtin University, GPO Box U1987, Perth WA 6845, Australia

Received  July 2018 Revised  April 2019 Published  May 2019

In this work we propose a novel numerical method for a finite-dimensional optimization problem arising from the discretization of an infinite-dimensional constrained optimization problem, called an obstacle problem, with interval coefficients. In this method, the two different ways of characterizing the optimal solutions, i.e., minimizing the mid-point and one end-point (the worst-case scenario) or the mid-point and the width of the objective interval, are formulated as a single constrained multi-objective minimization problem and the KKT conditions of the optimization problem defining the Pareto optimal solution to the multi-objective problem are of the form of a Linear Complementarity Problem (LCP) which is shown to have a unique solution. The LCP is the approximated by a non-linear equation using an interior penalty approach. We prove that the penalty equation is uniquely solvable and its solution converges to that of LCP as the penalty constant approaches to zero. Numerical results are presented to demonstrate the usefulness of the numerical method proposed.

Citation: Song Wang. Numerical solution of an obstacle problem with interval coefficients. Numerical Algebra, Control & Optimization, 2020, 10 (1) : 23-38. doi: 10.3934/naco.2019030
##### References:

show all references

##### References:
Computed optimal solution of Test 1 when $\theta = 0$
Computed optimal solution of Test 1 when $\theta = 0.5$
Computed optimal solution of Test 2 when $\theta = 0$
Computed optimal solution of Test 2 when $\theta = 0.5$
Computed solution at $\lambda = 0.5$; (a) and solution at $\theta = 0$, (b) difference between solutions of $\theta = 0$ and 0.5
 [1] Han Yang, Jia Yue, Nan-jing Huang. Multi-objective robust cross-market mixed portfolio optimization under hierarchical risk integration. Journal of Industrial & Management Optimization, 2020, 16 (2) : 759-775. doi: 10.3934/jimo.2018177 [2] Henri Bonnel, Ngoc Sang Pham. Nonsmooth optimization over the (weakly or properly) Pareto set of a linear-quadratic multi-objective control problem: Explicit optimality conditions. Journal of Industrial & Management Optimization, 2011, 7 (4) : 789-809. doi: 10.3934/jimo.2011.7.789 [3] Yuan-mei Xia, Xin-min Yang, Ke-quan Zhao. A combined scalarization method for multi-objective optimization problems. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020088 [4] Yibing Lv, Zhongping Wan. Linear bilevel multiobjective optimization problem: Penalty approach. Journal of Industrial & Management Optimization, 2019, 15 (3) : 1213-1223. doi: 10.3934/jimo.2018092 [5] Azam Moradi, Jafar Razmi, Reza Babazadeh, Ali Sabbaghnia. An integrated Principal Component Analysis and multi-objective mathematical programming approach to agile supply chain network design under uncertainty. Journal of Industrial & Management Optimization, 2019, 15 (2) : 855-879. doi: 10.3934/jimo.2018074 [6] Rouhollah Tavakoli, Hongchao Zhang. A nonmonotone spectral projected gradient method for large-scale topology optimization problems. Numerical Algebra, Control & Optimization, 2012, 2 (2) : 395-412. doi: 10.3934/naco.2012.2.395 [7] Xia Zhao, Jianping Dou. Bi-objective integrated supply chain design with transportation choices: A multi-objective particle swarm optimization. Journal of Industrial & Management Optimization, 2019, 15 (3) : 1263-1288. doi: 10.3934/jimo.2018095 [8] Xueyong Wang, Yiju Wang, Gang Wang. An accelerated augmented Lagrangian method for multi-criteria optimization problem. Journal of Industrial & Management Optimization, 2020, 16 (1) : 1-9. doi: 10.3934/jimo.2018136 [9] Jia Shu, Zhengyi Li, Weijun Zhong. A market selection and inventory ordering problem under demand uncertainty. Journal of Industrial & Management Optimization, 2011, 7 (2) : 425-434. doi: 10.3934/jimo.2011.7.425 [10] Qiang Long, Xue Wu, Changzhi Wu. Non-dominated sorting methods for multi-objective optimization: Review and numerical comparison. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020009 [11] Min Zhang, Gang Li. Multi-objective optimization algorithm based on improved particle swarm in cloud computing environment. Discrete & Continuous Dynamical Systems - S, 2019, 12 (4&5) : 1413-1426. doi: 10.3934/dcdss.2019097 [12] Liwei Zhang, Jihong Zhang, Yule Zhang. Second-order optimality conditions for cone constrained multi-objective optimization. Journal of Industrial & Management Optimization, 2018, 14 (3) : 1041-1054. doi: 10.3934/jimo.2017089 [13] Danthai Thongphiew, Vira Chankong, Fang-Fang Yin, Q. Jackie Wu. An on-line adaptive radiation therapy system for intensity modulated radiation therapy: An application of multi-objective optimization. Journal of Industrial & Management Optimization, 2008, 4 (3) : 453-475. doi: 10.3934/jimo.2008.4.453 [14] Changjun Yu, Kok Lay Teo, Liansheng Zhang, Yanqin Bai. On a refinement of the convergence analysis for the new exact penalty function method for continuous inequality constrained optimization problem. Journal of Industrial & Management Optimization, 2012, 8 (2) : 485-491. doi: 10.3934/jimo.2012.8.485 [15] Jiuping Xu, Pei Wei. Production-distribution planning of construction supply chain management under fuzzy random environment for large-scale construction projects. Journal of Industrial & Management Optimization, 2013, 9 (1) : 31-56. doi: 10.3934/jimo.2013.9.31 [16] Boshi Tian, Xiaoqi Yang, Kaiwen Meng. An interior-point $l_{\frac{1}{2}}$-penalty method for inequality constrained nonlinear optimization. Journal of Industrial & Management Optimization, 2016, 12 (3) : 949-973. doi: 10.3934/jimo.2016.12.949 [17] Tadeusz Antczak. The $F$-objective function method for differentiable interval-valued vector optimization problems. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020093 [18] Zhongwen Chen, Songqiang Qiu, Yujie Jiao. A penalty-free method for equality constrained optimization. Journal of Industrial & Management Optimization, 2013, 9 (2) : 391-409. doi: 10.3934/jimo.2013.9.391 [19] Jutamas Kerdkaew, Rabian Wangkeeree. Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty. Journal of Industrial & Management Optimization, 2020, 16 (6) : 2651-2673. doi: 10.3934/jimo.2019074 [20] Hong Seng Sim, Wah June Leong, Chuei Yee Chen, Siti Nur Iqmal Ibrahim. Multi-step spectral gradient methods with modified weak secant relation for large scale unconstrained optimization. Numerical Algebra, Control & Optimization, 2018, 8 (3) : 377-387. doi: 10.3934/naco.2018024

Impact Factor:

## Tools

Article outline

Figures and Tables