Back to Search
Start Over
A homotopy method for getting a local minimum of constrained nonconvex programming
- Source :
-
Nonlinear Analysis . Nov2009, Vol. 71 Issue 10, p4725-4731. 7p. - Publication Year :
- 2009
-
Abstract
- Abstract: In this paper, a combined interior point homotopy method is used to solve constrained nonconvex programming problems. Some results for the homotopy pathway are obtained. It is known that a K–K–T point can be obtained from this homotopy method, and it proves that, when the homotopy map is a regular map, the K–K–T point must be a local minimum point on choosing a proper homotopy equation. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0362546X
- Volume :
- 71
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Nonlinear Analysis
- Publication Type :
- Academic Journal
- Accession number :
- 43408915
- Full Text :
- https://doi.org/10.1016/j.na.2009.03.039