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...
Saved in:
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!
|
Similar Items
-
The Flattened Aggregate Constraint Homotopy Method for Nonlinear Programming Problems with Many Nonlinear Constraints
by: Zhengyong Zhou, et al.
Published: (2014-01-01) -
A Strongly Convergent Method for the Split Feasibility Problem
by: Yonghong Yao, et al.
Published: (2012-01-01) -
Strong Convergence of a Modified Extragradient Method to the Minimum-Norm Solution of Variational Inequalities
by: Yonghong Yao, et al.
Published: (2012-01-01) -
Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure
by: Miantao Chao, et al.
Published: (2020-01-01) -
Some Iterative Methods for Solving Nonconvex Bifunction Equilibrium Variational Inequalities
by: Muhammad Aslam Noor, et al.
Published: (2012-01-01)