检索结果-南通市图书馆

An Active-Set Projected Trust Region Algorithm for Box Constrained Optimization Problems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2015年第5期26卷 1128-1147页

作者： YUAN Gonglin wei zengxin ZHANG Maojun College of Mathematics and Information Science Guangxi University School of Mathematic and Computing Science Guilin University of Electronic Technology

关键词： Active-set strategy convergence trust region

THE CONVERGENCE OF A NEW MODIFIED BFGS METHOD WITHOUT LINE SEARCHES FOR UNCONSTRAINED OPTIMIZATION OR COMPLEXITY SYSTEMS

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2010年第4期23卷 861-872页

作者： Liying LIU zengxin wei Xiaoping WU College of Mathematics Science Liaocheng University Liaocheng 252059 China College of Mathematics and Information Science Guangxi University Nanning 530004 China School of Management Xi'an Jiaotong University Xi'an 710049 China

In this paper,a new modified BFGS method without line searches is *** traditionalBFGS method,this modified BFGS method is proposed based on the so-called fixed steplengthstrategy introduced by Sun and *** some suitable assumptions,the global convergence andthe superlinear convergence of the new algorithm are established,*** some preliminarynumerical experiments,which shows that the new Algorithm is feasible,is also reported.

关键词： BFGS method complexity systems global convergence superlinear convergence unconstrained optimization.

A Line Search Algorithm for Unconstrained Optimization

在线全文

学校读者我要写书评

暂无评论

Journal of Software Engineering and Applications 2010年第5期3卷 503-509页

作者： Gonglin Yuan Sha Lu zengxin wei College of Mathematics and Information Science Guangxi University Nanning China School of Mathematical Science Guangxi Teachers Education University Nanning China.

It is well known that the line search methods play a very important role for optimization problems. In this paper a new line search method is proposed for solving unconstrained optimization. Under weak conditions, this method possesses global convergence and R-linear convergence for nonconvex function and convex function, respectively. Moreover, the given search direction has sufficiently descent property and belongs to a trust region without carrying out any line search rule. Numerical results show that the new method is effective.

关键词： Line Search Unconstrained Optimization Global Convergence R-linear Convergence

A Rank-One Fitting Method with Descent Direction for Solving Symmetric Nonlinear Equations

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Communications, Network and System Sciences 2009年第6期2卷 555-561页

作者： Gonglin YUAN Zhongxing WANG zengxin wei 不详

In this paper, a rank-one updated method for solving symmetric nonlinear equations is proposed. This method possesses some features: 1) The updated matrix is positive definite whatever line search technique is used;2) The search direction is descent for the norm function;3) The global convergence of the given method is established under reasonable conditions. Numerical results show that the presented method is interesting.

关键词： Rank-One Update Global Convergence Nonlinear Equations Descent Direction

A Globally Convergent Polak-Ribiere-Polyak Conjugate Gradient Method with Armijo-Type Line Search

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Numerical Mathematics A Journal of Chinese Universities(English Series) 2006年第4期15卷 357-366页

作者： Gaohang Yu Lutai Guan zengxin wei Department of Scientific Computation and Computer Applications Sun Yat-Sen University Guangzhou 510275 China College of Mathematics and Information Science Guangxi University Nanning530004 China

In this paper, we propose a globally convergent Polak-Ribiere-Polyak (PRP) conjugate gradient method for nonconvex minimization of differentiable functions by employing an Armijo-type line search which is simpler and less demanding than those defined in [4,10]. A favorite property of this method is that we can choose the initial stepsize as the one-dimensional minimizer of a quadratic modelΦ(t):= f(xk)+tgkTdk+(1/2) t2dkTQkdk, where Qk is a positive definite matrix that carries some second order information of the objective function f. So, this line search may make the stepsize tk more easily accepted. Preliminary numerical results show that this method is efficient.

关键词：非约束最优化共轭梯度法整体收敛可微函数

The proof of the sufficient descent condition of the wei-Yao-Liu conjugateg radient method under the strong Wolfe-Powell line search

在线全文

学校读者我要写书评

暂无评论

南宁师范高等专科学校学报 2009年第C期26卷 21-23页

作者： Hai Huang zengxin wei Yao Shengwei

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

基于覆盖的粗糙集代数

重庆师范大学学报（自然科学版） 2016年第3期33卷 98-101页

作者：孔庆钊韦增欣华东理工大学理学院上海200237 集美大学理学院福建厦门361021 广西大学数学与信息科学学院南宁530004

一个粗糙集代数是由集合代数加上一对对偶近似算子构成的。首先研究了两种类型的基于覆盖的粗糙集代数的相关性质,可以得到在经典覆盖的情形下,粗糙集代数没有很好的性质。为此,引入了单调的覆盖的概念,进而讨论了在单调覆盖的情形下粗... 详细信息

一个粗糙集代数是由集合代数加上一对对偶近似算子构成的。首先研究了两种类型的基于覆盖的粗糙集代数的相关性质,可以得到在经典覆盖的情形下,粗糙集代数没有很好的性质。为此,引入了单调的覆盖的概念,进而讨论了在单调覆盖的情形下粗糙集代数的相关性质,得到了许多很好的结果。

关键词：覆盖单调粗糙集代数近似算子

The Convergence Properties of Some New Conjugate Gradient Methods

在线全文

学校读者我要写书评

暂无评论

The Convergence Properties of Some New Conjugate Gradient Me...

具有全局收敛性的求解对称非线性方程组的一个修改的信赖域方法

2006年中国运筹学会数学规划分会代表会议暨第六届学术会议

作者： zengxin wei Shengwei Yao Liying Liu (Department of Mathematics and Information Science, Guangxi University)

In this paper, a new conjugate gradient formula β k? is given to compute the search directions for unconstrained optimization problems. General convergence results for the proposed formula with some l

关键词：

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

计算数学 2007年第3期29卷 225-234页

作者：袁功林鲁习文韦增欣华东理工大学理学院上海200237 广西大学数学与信息科学学院南宁530004

本文给出一个求解非线性对称方程组问题的修改的信赖域方法,在适当的条件下我们将建立此方法的全局收敛性.对给定的问题而言,数值结果表明此方法是有效的.

关键词：信赖域方法全局收敛非线性方程组