Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming

Zhichuan Zhu, Yeong-Cheng Liou and Ching-Feng Wen

Journal of Mathematics, 2020, vol. 2020, 1-7

Abstract: In the paper, the aggregate constraint-shifting homotopy method for solving general nonconvex nonlinear programming is considered. The aggregation is only about inequality constraint functions. Without any cone condition for the constraint functions, the existence and convergence of the globally convergent solution to the K-K-T system are obtained for both feasible and infeasible starting points under much weaker conditions.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2020/8887029.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2020/8887029.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:8887029

DOI: 10.1155/2020/8887029

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().