Year: 2015
Author: Yonghong Ren, Fangfang Guo, Yang Li
Journal of Computational Mathematics, Vol. 33 (2015), Iss. 4 : pp. 396–414
Abstract
This paper proposes nonlinear Lagrangians based on modified Fischer-Burmeister NCP functions for solving nonlinear programming problems with inequality constraints. The convergence theorem shows that the sequence of points generated by this nonlinear Lagrange algorithm is locally convergent when the penalty parameter is less than a threshold under a set of suitable conditions on problem functions, and the error bound of solution, depending on the penalty parameter, is also established. It is shown that the condition number of the nonlinear Lagrangian Hessian at the optimal solution is proportional to the controlling penalty parameter. Moreover, the paper develops the dual algorithm associated with the proposed nonlinear Lagrangians. Numerical results reported suggest that the dual algorithm based on proposed nonlinear Lagrangians is effective for solving some nonlinear optimization problems.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/jcm.1503-m2014-0044
Journal of Computational Mathematics, Vol. 33 (2015), Iss. 4 : pp. 396–414
Published online: 2015-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 19
Keywords: nonlinear Lagrangian nonlinear Programming modified Fischer-Burmeister NCP function dual algorithm condition number.