共查询到20条相似文献,搜索用时 531 毫秒
1.
无约束优化问题的对角稀疏拟牛顿法 总被引:3,自引:0,他引:3
对无约束优化问题提出了对角稀疏拟牛顿法,该算法采用了Armijo非精确线性搜索,并在每次迭代中利用对角矩阵近似拟牛顿法中的校正矩阵,使计算搜索方向的存贮量和工作量明显减少,为大型无约束优化问题的求解提供了新的思路.在通常的假设条件下,证明了算法的全局收敛性,线性收敛速度并分析了超线性收敛特征。数值实验表明算法比共轭梯度法有效,适于求解大型无约束优化问题. 相似文献
2.
Quasi-Newton method by Hermite interpolation 总被引:1,自引:0,他引:1
T. F. Sturm 《Journal of Optimization Theory and Applications》1994,83(3):587-612
This paper describes a new attempt to solve the problem of computing a local minimizer of a sufficiently often differentiable unconstrained objective function. In every step of the iteration, a special Hermite interpolant is constructed. Old iteration points serve as points of support with the function value and gradient information. This yields a quasi-Newton algorithm with quadratic convergence order. 相似文献
3.
Large scale nonlinear systems of equations can be solved by means of inexact quasi-Newton methods. A global convergence theory is introduced that guarantees that, under reasonable assumptions, the algorithmic sequence converges to a solution of the problem. Under additional standard assumptions, superlinear convergence is preserved. 相似文献
4.
A Classification of Quasi-Newton Methods 总被引:4,自引:0,他引:4
C. Brezinski 《Numerical Algorithms》2003,33(1-4):123-135
In this paper, we consider quasi-Newton methods of the form x
k+1=x
k
+
k
f(x
k
), k=0,1,. . ., for the solution of the system of nonlinear equations f(x)=0. We present a classification of such methods based on different structures for the matrix
k
and various criteria for its computation, issued from three different formulae. Many known methods can be put into this framework and new methods are also obtained. 相似文献
5.
Zhang J. Z. Deng N. Y. Chen L. H. 《Journal of Optimization Theory and Applications》1999,102(1):147-167
In unconstrained optimization, the usual quasi-Newton equation is B
k+1
s
k=y
k, where y
k is the difference of the gradients at the last two iterates. In this paper, we propose a new quasi-Newton equation,
, in which
is based on both the function values and gradients at the last two iterates. The new equation is superior to the old equation in the sense that
better approximates 2
f(x
k+1)s
k than y
k. Modified quasi-Newton methods based on the new quasi-Newton equation are locally and superlinearly convergent. Extensive numerical experiments have been conducted which show that the new quasi-Newton methods are encouraging. 相似文献
6.
Hiroshi Yabe Hideho Ogasawara Masayuki Yoshino 《Journal of Computational and Applied Mathematics》2007
For solving unconstrained minimization problems, quasi-Newton methods are popular iterative methods. The secant condition which employs only the gradient information is imposed on these methods. Several researchers paid attention to other secant conditions to get a better approximation of the Hessian matrix of the objective function. Recently, Zhang et al. [New quasi-Newton equation and related methods for unconstrained optimization, J. Optim. Theory Appl. 102 (1999) 147–167] and Zhang and Xu [Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations, J. Comput. Appl. Math. 137 (2001) 269–278] proposed the modified secant condition which uses both gradient and function value information in order to get a higher order accuracy in approximating the second curvature of the objective function. They showed the local and q-superlinear convergence property of the BFGS-like and DFP-like updates based on their proposed secant condition. In this paper, we incorporate one parameter into this secant condition to smoothly switch the standard secant condition and the secant condition of Zhang et al. We consider a modified Broyden family which includes the BFGS-like and the DFP-like updates proposed by Zhang et al. We prove the local and q-superlinear convergence of our method. 相似文献
7.
Keyvan Amini Ashraf Ghorbani Rizi 《Journal of Computational and Applied Mathematics》2010,234(3):805-811
This paper presents a modified quasi-Newton method for structured unconstrained optimization. The usual SQN equation employs only the gradients, but ignores the available function value information. Several researchers paid attention to other secant conditions to get a better approximation of the Hessian matrix of the objective function. Recently Yabe et al. (2007) [6] proposed the modified secant condition which uses both gradient and function value information in order to get a higher-order accuracy in approximating the second curvature of the objective function. In this paper, we derive a new progressive modified SQN equation, with a vector parameter which use both available gradient and function value information, that maintains most properties of the usual and modified structured quasi-Newton methods. Furthermore, local and superlinear convergence of the algorithm is obtained under some reasonable conditions. 相似文献
8.
Quasi-Newton methods in conjunction with the piecewise sequential quadratic programming are investigated for solving mathematical programming with equilibrium constraints, in particular for problems with complementarity constraints. Local convergence as well as superlinear convergence of these quasi-Newton methods can be established under suitable assumptions. In particular, several well-known quasi-Newton methods such as BFGS and DFP are proved to exhibit the local and superlinear convergence. 相似文献
9.
研究Banach空间中非光滑算子方程的光滑化拟牛顿法.构造光滑算子逼近非光滑算子,在光滑逼近算子满足方向可微相容性的条件下,证明了光滑化拟牛顿法具有局部超线性收敛性质.应用说明了算法的有效性. 相似文献
10.
Boubakeur Benahmed Hocine Mokhtar-Kharroubi Bruno de Malafosse Adnan Yassine 《Journal of Global Optimization》2011,49(3):365-379
In the first part of this paper, we give a survey on convergence rates analysis of quasi-Newton methods in infinite Hilbert
spaces for nonlinear equations. Then, in the second part we apply quasi-Newton methods in their Hilbert formulation to solve
matrix equations. So, we prove, under natural assumptions, that quasi-Newton methods converge locally and superlinearly; the
global convergence is also studied. For numerical calculations, we propose new formulations of these methods based on the
matrix representation of the dyadic operator and the vectorization of matrices. Finally, we apply our results to algebraic
Riccati equations. 相似文献
11.
Mukund N. Thapa 《Mathematical Programming》1983,25(2):158-182
Newton-type methods and quasi-Newton methods have proven to be very successful in solving dense unconstrained optimization
problems. Recently there has been considerable interest in extending these methods to solving large problems when the Hessian
matrix has a known a priori sparsity pattern. This paper treats sparse quasi-Newton methods in a uniform fashion and shows
the effect of loss of positive-definiteness in generating updates. These sparse quasi-Newton methods coupled with a modified
Cholesky factorization to take into account the loss of positive-definiteness when solving the linear systems associated with
these methods were tested on a large set of problems. The overall conclusions are that these methods perform poorly in general—the
Hessian matrix becomes indefinite even close to the solution and superlinear convergence is not observed in practice.
Research for this paper was performed at the Department of Operations Research, Stanford, CA 94305. The research was partially
supported by the Department of Energy Contract AM03-76SF00326. PA# DE-AT03-76ER72018: Office of Naval Research Contract N00014-75-C-0267;
National Science Foundation Grants MCS-7681259, MCS-7926009 and ECS-8012974. 相似文献
12.
This paper is concerned with quadratic and superlinear convergence of structured quasi-Newton methods for solving nonlinear least squares problems. These methods make use of a special structure of the Hessian matrix of the objective function. Recently, Huschens proposed a new kind of structured quasi-Newton methods and dealt with the convex class of the structured Broyden family, and showed its quadratic and superlinear convergence properties for zero and nonzero residual problems, respectively. In this paper, we extend the results by Huschens to a wider class of the structured Broyden family. We prove local convergence properties of the method in a way different from the proof by Huschens. 相似文献
13.
This paper is concerned with the solution of nonlinear algebraic systems of equations. For this problem, we suggest new methods, which are combinations of the nonlinear ABS methods and quasi-Newton methods. Extensive numerical experiments compare particular algorithms and show the efficiency of the proposed methods.The authors are grateful to Professors C. G. Broyden and E. Spedicato for many helpful discussions. 相似文献
14.
Neculai Andrei 《Numerical Functional Analysis & Optimization》2019,40(13):1467-1488
A new diagonal quasi-Newton updating algorithm for unconstrained optimization is presented. The elements of the diagonal matrix approximating the Hessian are determined as scaled forward finite differences directional derivatives of the components of the gradient. Under mild classical assumptions, the convergence of the algorithm is proved to be linear. Numerical experiments with 80 unconstrained optimization test problems, of different structures and complexities, as well as five applications from MINPACK-2 collection, prove that the suggested algorithm is more efficient and more robust than the quasi-Newton diagonal algorithm retaining only the diagonal elements of the BFGS update, than the weak quasi-Newton diagonal algorithm, than the quasi-Cauchy diagonal algorithm, than the diagonal approximation of the Hessian by the least-change secant updating strategy and minimizing the trace of the matrix, than the Cauchy with Oren and Luenberger scaling algorithm in its complementary form (i.e. the Barzilai-Borwein algorithm), than the steepest descent algorithm, and than the classical BFGS algorithm. However, our algorithm is inferior to the limited memory BFGS algorithm (L-BFGS). 相似文献
15.
本文给出了适于在MIMD机上解非线性方程组的同步化并行Broyden方法和换列修正拟Newton法的迭代格式,以及它们的局部收敛性定理.数值试验结果也验证了收敛性. 相似文献
16.
Issam A. R. Moghrabi 《Journal of Mathematical Modelling and Algorithms》2007,6(2):231-238
The authors have derived what they termed quasi-Newton multi step methods in [2]. These methods have demonstrated substantial numerical improvements over the standard single step Secant-based BFGS. Such
methods use a variant of the Secant equation that the updated Hessian (or its inverse) satisfies at each iteration. In this
paper, new methods will be explored for which the updated Hessians satisfy multiple relations of the Secant-type. A rational
model is employed in developing the new methods. The model hosts a free parameter which is exploited in enforcing symmetry
on the updated Hessian approximation matrix thus obtained. The numerical performance of such techniques is then investigated
and compared to other methods. Our results are encouraging and the improvements incurred supercede those obtained from other
existing methods at minimal extra storage and computational overhead. 相似文献
17.
Local convergence analysis for partitioned quasi-Newton updates 总被引:8,自引:0,他引:8
Summary This paper considers local convergence properties of inexact partitioned quasi-Newton algorithms for the solution of certain non-linear equations and, in particular, the optimization of partially separable objective functions. Using the bounded deterioration principle, one obtains local and linear convergence, which impliesQ-superlinear convergence under the usual conditions on the quasi-Newton updates. For the optimization case, these conditions are shown to be satisfied by any sequence of updates within the convex Broyden class, even if some Hessians are singular at the minimizer. Finally, local andQ-superlinear convergence is established for an inexact partitioned variable metric method under mild assumptions on the initial Hessian approximations.Work supported by a research grant of the Deutsche Forschungsgemeinschaft, Bonn and carried out at the Department of Applied Mathematics and Theoretical Physics Cambridge (United Kingdom) 相似文献
18.
Farzin Modarres Abu Hassan MalikWah June Leong 《Journal of Computational and Applied Mathematics》2011,235(8):2423-2431
Symmetric rank-one (SR1) is one of the competitive formulas among the quasi-Newton (QN) methods. In this paper, we propose some modified SR1 updates based on the modified secant equations, which use both gradient and function information. Furthermore, to avoid the loss of positive definiteness and zero denominators of the new SR1 updates, we apply a restart procedure to this update. Three new algorithms are given to improve the Hessian approximation with modified secant equations for the SR1 method. Numerical results show that the proposed algorithms are very encouraging and the advantage of the proposed algorithms over the standard SR1 and BFGS updates is clearly observed. 相似文献
19.
基于修正拟牛顿方程,利用Goldstein-Levitin-Polyak(GLP)投影技术,建立了求解带凸集约束的优化问题的两阶段步长非单调变尺度梯度投影算法,证明了算法的全局收敛性和一定条件下的Q超线性收敛速率.数值结果表明新算法是有效的,适合求解大规模问题. 相似文献
20.
Leopoldo Marini Benedetta Morini Margherita Porcelli 《Computational Optimization and Applications》2018,71(1):147-170
We address the solution of constrained nonlinear systems by new linesearch quasi-Newton methods. These methods are based on a proper use of the projection map onto the convex constraint set and on a derivative-free and nonmonotone linesearch strategy. The convergence properties of the proposed methods are presented along with a worst-case iteration complexity bound. Several implementations of the proposed scheme are discussed and validated on bound-constrained problems including gas distribution network models. The results reported show that the new methods are very efficient and competitive with an existing affine-scaling procedure. 相似文献