Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93824
Title: | Solution method for discrete double obstacle problems based on a power penalty approach | Authors: | Zhang, K Yang, X Wang, S |
Issue Date: | Mar-2022 | Source: | Journal of industrial and management optimization, Mar 2022, v. 18, no. 2, p. 1261-1274 | Abstract: | We develop a power penalty approach to a finite-dimensional double obstacle problem. This problem is first approximated by a system of nonlinear equations containing two penalty terms. We show that the solution to this penalized equation converges to that of the original obstacle problem at an exponential rate when the coefficient matrices are M-matrices. Numerical examples are presented to confirm the theoretical findings and illustrate the efficiency and effectiveness of the new method. | Keywords: | Complementarity problem Convergence rate Double obstacle problem Numerical optimization Penalty method |
Publisher: | American Institute of Mathematical Sciences | Journal: | Journal of industrial and management optimization | ISSN: | 1553-166X | EISSN: | 1547-5816 | DOI: | 10.3934/jimo.2021018 | Rights: | © 2021 The Author(s). Published by AIMS, LLC. This is an Open Access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). The following publication Kai Zhang, Xiaoqi Yang, Song Wang. Solution method for discrete double obstacle problems based on a power penalty approach. Journal of Industrial and Management Optimization, 2022, 18 (2) : 1261-1274 is available at https://doi.org/10.3934/jimo.2021018. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Zhang_Solution_Method_Discreet.pdf | 741.73 kB | Adobe PDF | View/Open |
Page views
49
Last Week
0
0
Last month
Citations as of Apr 28, 2024
Downloads
31
Citations as of Apr 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.