| 一个广义既约次梯度算法 |
| |
| 引用本文： | 孟强. 一个广义既约次梯度算法[J]. 山东师范大学学报(自然科学版), 1991, 6(1): 24-27,23 |
| |
| 作者姓名： | 孟强 |
| |
| 作者单位： | 山东师大计算机科学系 |
| |
| 摘 要： | 本文主要讨论带有非线性约束的不可微凸规划问题,给出了解这类问题的一个广义既约次梯度算法,算法具有全局收敛性质,存贮次梯度的规模可由用户控制,利于算法的计算机实现。
|
| 关 键 词： | 不可微凸规划 迭代下降算法 |
A GENERALIZED REDUCED SUBGRADIENT ALGORITHM |
| |
| Meng Qiang. A GENERALIZED REDUCED SUBGRADIENT ALGORITHM[J]. Journal of Shandong Normal University(Natural Science), 1991, 6(1): 24-27,23 |
| |
| Authors: | Meng Qiang |
| |
| Affiliation: | Meng Qiang Department of Computer Science |
| |
| Abstract: | In this paper, we discuss the nonsmooth convex optimization with nonlinear con-straints and propose a generalized reduced subgradient algorithm for solving this problem.The algorithm is a descent method and has a global convergence property. The method is easi-ly realized by the computer. |
| |
| Keywords: | nonsmooth convex optimization generalized reduced subgradient algorithm global convergence |
| 本文献已被 CNKI 维普 等数据库收录！ |
