Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints

Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
复制标题

不等式和等式约束非线性规划问题聚合约束同伦法的全局收敛性分析

DOI:
10.1080/02331934.2018.1470174
复制
发表时间:
2018-05
期刊:
影响因子:
2.2
通讯作者:
Wang Fenghui
Wang Fenghui
中科院分区:
数学3区
文献类型:
--
作者:
Zhou Zhengyong;Su Menglong;Shang Yufeng;Wang Fenghui

文献摘要

参考文献

相似文献

摘要本文通过将等式约束转化为不等式约束,并引入两个可变参数,构造了合适的聚合映射和一个新的聚合约束同伦方程。然后,我们提出了一个ACH方法的非线性规划问题的不等式和等式约束。在适当的条件下,我们得到了ACH方法的全局收敛性,从而证明了非线性规划问题的Karush-Kuhn-Tucker点与给定点之间存在有界光滑路径.该路径的数值跟踪可以导致可实现的全局收敛算法。给出了实现该方法的数值计算过程,并给出了计算结果。
Abstract In this paper, we construct appropriate aggregate mappings and a new aggregate constraint homotopy (ACH) equation by converting equality constraints to inequality constraints and introducing two variable parameters. Then, we propose an ACH method for nonlinear programming problems with inequality and equality constraints. Under suitable conditions, we obtain the global convergence of this ACH method, which makes us prove the existence of a bounded smooth path that connects a given point to a Karush–Kuhn–Tucker point of nonlinear programming problems. The numerical tracking of this path can lead to an implementable globally convergent algorithm. A numerical procedure is given to implement the proposed ACH method, and the computational results are reported.
DOI: 10.1287/moor.15.3.408
发表时间: 1990-08
期刊: Math. Oper. Res.
影响因子: --
作者:
R. Monteiro;I. Adler
通讯作者: R. Monteiro;I. Adler
DOI: 10.1007/bf02241698
发表时间: 1982-09
期刊: Computing
影响因子: 3.7
作者:
R. Melhem;W. Rheinboldt
通讯作者: R. Melhem;W. Rheinboldt
DOI: 10.1145/800057.808695
发表时间: 1984-12
期刊: Combinatorica
影响因子: 1.1
作者:
N. Karmarkar
通讯作者: N. Karmarkar
DOI: 10.1137/0718066
发表时间: 1981-10
期刊: --
影响因子: --
作者:
den C. Heijer;W. Rheinboldt
通讯作者: den C. Heijer;W. Rheinboldt
DOI: 10.1016/j.na.2010.06.032
发表时间: 2010-10
影响因子: 1.4
作者:
Menglong Su;Menglong Su;Bo Yu;Jian Wang
通讯作者: Menglong Su;Menglong Su;Bo Yu;Jian Wang