Show simple item record

dc.contributor.authorZhao, J.
dc.contributor.authorWang, Song
dc.date.accessioned2018-12-13T09:08:30Z
dc.date.available2018-12-13T09:08:30Z
dc.date.created2018-12-12T02:46:42Z
dc.date.issued2019
dc.identifier.citationZhao, J. and Wang, S. 2019. A power penalty approach to a discretized obstacle problem with nonlinear constraints. Optimization Letters. 13 (7): pp. 1483–1504.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/71030
dc.identifier.doi10.1007/s11590-018-1354-7
dc.description.abstract

A novel power penalty method is proposed to solve a nonlinear obstacle problem with nonlinear constraints arising from the discretization of an infinite-dimensional optimization problem. This approach is based on the formulation of a penalty equation approximating the mixed nonlinear complementarity problem arising from the Karush–Kuhn–Tucker conditions of the optimization problem. We show that the solution to the penalty equation converges to that of the complementarity problem with an exponential convergence rate depending on the parameters used in the penalty equation. Numerical experiments are performed to confirm the theoretical convergence rate established.

dc.publisherSpringer Verlag
dc.titleA power penalty approach to a discretized obstacle problem with nonlinear constraints
dc.typeJournal Article
dcterms.source.issn1862-4472
dcterms.source.titleOptimization Letters
curtin.departmentSchool of Electrical Engineering, Computing and Mathematical Science (EECMS)
curtin.accessStatusFulltext not available


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record