摘要
An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function, a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.
源语言 | 英语 |
---|---|
页(从-至) | 1491-1498 |
页数 | 8 |
期刊 | Applied Mathematics and Mechanics (English Edition) |
卷 | 26 |
期 | 11 |
DOI | |
出版状态 | 已出版 - 11月 2005 |
已对外发布 | 是 |
指纹
探究 'Newton method for solving a class of smooth convex programming' 的科研主题。它们共同构成独一无二的指纹。引用此
Yao, Y. R., Zhang, L. S., & Han, B. S. (2005). Newton method for solving a class of smooth convex programming. Applied Mathematics and Mechanics (English Edition), 26(11), 1491-1498. https://doi.org/10.1007/BF03246256