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

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 con...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhichuan Zhu, Yeong-Cheng Liou
Format: Article
Language:English
Published: Wiley 2020-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2020/8887029
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832547131907375104
author Zhichuan Zhu
Yeong-Cheng Liou
author_facet Zhichuan Zhu
Yeong-Cheng Liou
author_sort Zhichuan Zhu
collection DOAJ
description 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.
format Article
id doaj-art-1d9edf0b38864f51a631e4d011a041e7
institution Kabale University
issn 2314-4629
2314-4785
language English
publishDate 2020-01-01
publisher Wiley
record_format Article
series Journal of Mathematics
spelling doaj-art-1d9edf0b38864f51a631e4d011a041e72025-02-03T06:45:52ZengWileyJournal of Mathematics2314-46292314-47852020-01-01202010.1155/2020/88870298887029Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex ProgrammingZhichuan Zhu0Yeong-Cheng Liou1School of Economics, Liaoning University, Shenyang, Liaoning 110136, ChinaDepartment of Healthcare Administration and Medical Informatics, and Research Center of Nonlinear Analysis and Optimization, Kaohsiung Medical University, Kaohsiung 807, TaiwanIn 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.http://dx.doi.org/10.1155/2020/8887029
spellingShingle Zhichuan Zhu
Yeong-Cheng Liou
Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
Journal of Mathematics
title Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
title_full Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
title_fullStr Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
title_full_unstemmed Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
title_short Strong Convergence on the Aggregate Constraint-Shifting Homotopy Method for Solving General Nonconvex Programming
title_sort strong convergence on the aggregate constraint shifting homotopy method for solving general nonconvex programming
url http://dx.doi.org/10.1155/2020/8887029
work_keys_str_mv AT zhichuanzhu strongconvergenceontheaggregateconstraintshiftinghomotopymethodforsolvinggeneralnonconvexprogramming
AT yeongchengliou strongconvergenceontheaggregateconstraintshiftinghomotopymethodforsolvinggeneralnonconvexprogramming