Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming (Q2228205)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming |
scientific article; zbMATH DE number 7311485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming |
scientific article; zbMATH DE number 7311485 |
Statements
Strong convergence on the aggregate constraint-shifting homotopy method for solving general nonconvex programming (English)
0 references
16 February 2021
0 references
Summary: 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.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93926805
0 references
0 references
0.9060381
0 references
0.90569156
0 references
0 references
0.8973392
0 references
0.8969306
0 references
0.8954134
0 references
0.88806707
0 references
