TWO ALGORITHMS FOR LC^1 UNCONSTRAINED OPTIMIZATION
TWO ALGORITHMS FOR LC^1 UNCONSTRAINED OPTIMIZATION作者机构:School of Mathematics and Computer ScienceNanjing Normal UniversityNanjing 210097China Applied Informatics ProgramPontifical Catholic University of ParanaCuritibaPR81611-970Brazil Department of MathematicsFederal University of ParanaCuritibaPR81531-990Brazil
出 版 物:《Journal of Computational Mathematics》 (计算数学(英文))
年 卷 期:2000年第18卷第6期
页 面:621-632页
核心收录:
学科分类:12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学]
基 金:CNPq of Brazil and the National Natural Science Foundation of China
主 题:nonsmooth optimization directional derivative Newton-like method convergence trust region method
摘 要:Presents two algorithms for LC unconstrained optimization problems which use the second order Dini upper directional derivative. Simplicity of the methods to use and perform; Discussion of related properties of the iteration function.