| 多场址问题的信赖域算法 |
| |
| 引用本文： | 杨益民.多场址问题的信赖域算法[J].数学杂志,1997,17(4):506-512. |
| |
| 作者姓名： | 杨益民 |
| |
| 作者单位： | 安徽机电学院 |
| |
| 基金项目： | 安徽省高校中青年学科带头人培养基金 |
| |
| 摘 要： | 多场址问题是一类重要的不可微凸规划问题，国内外已有许多学者对其进行研究，并提出了一 算法。但如文「２」中所述，大多数算法或无收敛收保证，或在较强的条件下才保证收敛，本文提出一类解多场址问题的信赖域算法，并在极弱的条件下证明该类算法的全局收敛性。
|
| 关 键 词： | 多场址问题 信赖域算法 不可微凸规划 凸规划 |
A CLASS OF TRUST REGION ALGORITHMS FOR MULTIFACILITY LOCATION |
| |
| Yang Yimin.A CLASS OF TRUST REGION ALGORITHMS FOR MULTIFACILITY LOCATION[J].Journal of Mathematics,1997,17(4):506-512. |
| |
| Authors: | Yang Yimin |
| |
| Abstract: | The multifacility location is an important nonsmooth convex programming problem which has attracted a large literature. But for global convergence, most algorithms need strong assumptions on the problem, even the convergence has not been proved, as said in . In the paper, a class of TR algorithms is proposed and global convergence of the algorithms is proved under a weaker condition. |
| |
| Keywords: | multifacility location trust region algorithm global convergence |
| 本文献已被 CNKI 维普 等数据库收录！ |
