非凸非精确线搜索时Broyden算法的收敛性

Operations Research Transactions ›› 2012, Vol. 16 ›› Issue (3): 100-108.

• Original Articles • Previous Articles Next Articles

The convergence of Broyden algorithms without convexity and exact line search

PU Dingguo^1,2, SHANG Youlin¹, FANG Aifen¹, SUN Zhenyang¹

1. Department of Mathematics, Henan University of Science and Technology 2. Department of Mathematics, Tongji University

Received:2011-06-01 Revised:2012-02-28 Online:2012-09-15 Published:2012-09-18
Contact: Pu Dingguo E-mail:madpu@tongji.edu.cn
Supported by:
National Science Foundation of China (Nos. 10771162, U1135003)

Abstract

CLC Number:

90C30

PU Dingguo, SHANG Youlin, FANG Aifen, SUN Zhenyang. The convergence of Broyden algorithms without convexity and exact line search[J]. Operations Research Transactions, 2012, 16(3): 100-108.

[1]	MIAO Xiaonan, GU Jian, XIAO Xiantao. A cubic regularization method for solving nonsmooth equations [J]. Operations Research Transactions, 2019, 23(2): 17-30.
[2]	LI Jianling, ZHANG Hui, YANG Zhenping, JIAN Jinbao. A globally convergent SSDP algorithm without a penalty function or a filter for nonlinear semidefinite programming [J]. Operations Research Transactions, 2018, 22(4): 1-16.
[3]	TIAN Mingyu, YANG Yongjian. A global optimization algorithm for polynomial programming [J]. Operations Research Transactions, 2018, 22(4): 79-88.
[4]	CHEN Xiangping. Spectral HS projection algorithm for solving nonlinear monotone equations [J]. Operations Research Transactions, 2018, 22(3): 15-27.
[5]	. A sufficient descent conjugate gradient method for nonlinear unconstrained optimization problems [J]. Operations Research Transactions, 2018, 22(3): 59-68.
[6]	SHAO Shuting, DU Shouqiang. Smoothing cautious DPRP conjugate gradient method for solving a kind of special nonsmooth equations with max-type function [J]. Operations Research Transactions, 2018, 22(3): 69-78.
[7]	HE Bingsheng. My 20 years research on alternating directions method of multipliers [J]. Operations Research Transactions, 2018, 22(1): 1-31.
[8]	LIANG Na, DU Shouqiang. Nonsmooth Newton method for solving symmetrical tensor absolute value equations [J]. Operations Research Transactions, 2017, 21(3): 95-102.
[9]	CHEN Zhongwen, ZHAO Qi, BIAN Kai. A successive linearization method with flexible penalty for nonlinear semidefinite programming [J]. Operations Research Transactions, 2017, 21(2): 84-100.
[10]	CHEN Yuanyuan, GAO Yan, LIU Zhimin, DU Shouqiang. The smoothing gradient method for a kind of special optimization problem [J]. Operations Research Transactions, 2017, 21(2): 119-125.
[11]	TIAN Zhaowei, ZHANG Liwei. A look at the convergence of the augmented Lagrange method for nondifferentiable convex programming from the view of a gradient method with constant stepsize [J]. Operations Research Transactions, 2017, 21(1): 111-117.
[12]	LI Fei, TANG Liping, YANG Xinmin. A kind of cone-convexity for set-valued maps and its scalarization [J]. Operations Research Transactions, 2016, 20(4): 21-29.
[13]	HANG Dan, YAN Shijian. Convergence of nonmonotonic Perry-Shanno's memoryless quasi-Newton method with parameters [J]. Operations Research Transactions, 2016, 20(4): 85-92.
[14]	WANG Chun, QIU Xiaoling, WANG Nengfa, CHEN Pinbo. Stability to bounded rationality for nonconvexity [J]. Operations Research Transactions, 2016, 20(3): 107-120.
[15]	HUO Yongliang. Stability of optimal solution set and optimal value for minimax stochastic programming approximation problems [J]. Operations Research Transactions, 2016, 20(1): 75-83.

The convergence of Broyden algorithms without convexity and exact line search

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments