检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Nancy Baygorrea Erik Alex Papa Quiroz Nelson Maculan
出 处:《Journal of the Operations Research Society of China》2017年第4期457-467,共11页中国运筹学会会刊(英文)
基 金:Coordenação de Aperfeiçoamento de Pessoal de Nível Superior of the Federal University of Rio de Janeiro(UFRJ),Brazil.
摘 要:In this paper,we present an analysis about the rate of convergence of an inexact proximal point algorithm to solve minimization problems for quasiconvex objective functions on Hadamard manifolds.We prove that under natural assumptions the sequence generated by the algorithm converges linearly or superlinearly to a critical point of the problem.
关 键 词:Proximal point method Quasiconvex function Hadamard manifolds Nonsmooth optimization Abstract subdifferential Convergence rate
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229