共查询到20条相似文献,搜索用时 78 毫秒
1.
Jin-yanFan Wen-baoAi Qun-yingZhang 《计算数学(英文版)》2004,22(6):865-872
In this paper, we present a new line search and trust region algorithm for unconstrained optimization problem with the trust region radius converging to zero. The new trust region algorithm performs a backtracking line search from the failed, point instead of resolving the subproblem when the trial step results in an increase in the objective function. We show that the algorithm preserves the convergence properties of the traditional trust region algorithms. Numerical results are also given. 相似文献
2.
In this paper, an adaptive trust region algorithm that uses Moreau–Yosida regularization is proposed for solving nonsmooth unconstrained optimization problems. The proposed algorithm combines a modified secant equation with the BFGS update formula and an adaptive trust region radius, and the new trust region radius utilizes not only the function information but also the gradient information. The global convergence and the local superlinear convergence of the proposed algorithm are proven under suitable conditions. Finally, the preliminary results from comparing the proposed algorithm with some existing algorithms using numerical experiments reveal that the proposed algorithm is quite promising for solving nonsmooth unconstrained optimization problems. 相似文献
3.
4.
Qun-yan Zhou Wen-yu Sun 《计算数学(英文版)》2006,24(6):761-770
In this paper,an algorithm for unconstrained optimization that employs both trustregion techniques and curvilinear searches is proposed.At every iteration,we solve thetrust region subproblem whose radius is generated adaptively only once.Nonmonotonicbacktracking curvilinear searches are performed when the solution of the subproblem isunacceptable.The global convergence and fast local convergence rate of the proposedalgorithms are established under some reasonable conditions.The results of numericalexperiments are reported to show the effectiveness of the proposed algorithms. 相似文献
5.
In this paper, based on a simple model of trust region sub-problem, we combine the trust region method with the non-monotone and self-adaptive techniques to propose a new non-monotone self-adaptive trust region algorithm for unconstrained optimization. By use of the simple model, the new method needs less memory capacitance, computational complexity and CPU time. The convergence results of the method are proved under certain conditions. Numerical results show that the new method is effective and attractive for large-scale optimization problems. 相似文献
6.
A SELF—ADAPTIVE TRUST REGION ALGORITHM 总被引:10,自引:0,他引:10
LongHei 《计算数学(英文版)》2003,21(2):229-236
In this paper we propose a self-adaptive trust region algorithm.The trust region radius is updated at a varable rate according to the ratio between the actual reduction and the predicted reduction of the objective function,rather than by simply enlarging or reducing the original trust region radius at a constant rate.We show that this new algorithm preserves the strong convergence property of traditional trust region methods.Numerical results are also presented. 相似文献
7.
一类带非单调线搜索的信赖域算法 总被引:1,自引:0,他引:1
通过将非单调Wolfe线搜索技术与传统的信赖域算法相结合,我们提出了一类新的求解无约束最优化问题的信赖域算法.新算法在每一迭代步只需求解一次信赖域子问题,而且在每一迭代步Hesse阵的近似都满足拟牛顿条件并保持正定传递.在一定条件下,证明了算法的全局收敛性和强收敛性.数值试验表明新算法继承了非单调技术的优点,对于求解某... 相似文献
8.
Based on simple quadratic models of the trust region subproblem, we combine the trust region method with the nonmonotone and adaptive techniques to propose a new nonmonotone adaptive trust region algorithm for unconstrained optimization. Unlike traditional trust region method, our trust region subproblem is very simple by using a new scale approximation of the minimizing function??s Hessian. The new method needs less memory capacitance and computational complexity. The convergence results of the method are proved under certain conditions. Numerical results show that the new method is effective and attractive for large scale unconstrained problems. 相似文献
9.
In this paper, based on a simple model of the trust region subproblem, we propose a new self-adaptive trust region method with a line search technique for solving unconstrained optimization problems. By use of the simple subproblem model, the new method needs less memory capacitance and computational complexity. And the trust region radius is adjusted with a new self-adaptive adjustment strategy which makes full use of the information at the current point. When the trial step results in an increase in the objective function, the method does not resolve the subproblem, but it performs a line search technique from the failed point. Convergence properties of the method are proved under certain conditions. Numerical experiments show that the new method is effective and attractive for large-scale optimization problems. 相似文献
10.
一类优化问题的非单调信赖域算法 总被引:1,自引:0,他引:1
本文提出了一类带不等式约束和简单边界的非线性优化问题的非单调信赖域算法,在一定的条件下,证明了算法的全局收敛性,并通过数值实验验证了算法的合理性。 相似文献
11.
凸约束优化问题的带记忆模型信赖域算法 总被引:1,自引:0,他引:1
本文我们考虑求解凸约束优化问题的信赖域方法 .与传统的方法不同 ,我们信赖域子问题的逼近模型中包括过去迭代点的信息 ,该模型使我们可以从更全局的角度来求得信赖域试探步 ,从而避免了传统信赖域方法中试探步的求取完全依赖于当前点的信息而过于局部化的困难 .全局收敛性的获得是依靠非单调技术来保证的 相似文献
12.
In this paper, we present a nonmonotone adaptive trust region method for unconstrained optimization based on conic model. The new method combines nonmonotone technique and a new way to determine trust region radius at each iteration. The local and global convergence properties are proved under reasonable assumptions. Numerical experiments show that our algorithm is effective. 相似文献
13.
Jian-guo Liu 《计算数学(英文版)》2002,20(3):225-244
AbstractAn interior trust-region-based algorithm for linearly constrained minimization problems is proposed and analyzed. This algorithm is similar to trust region algorithms for unconstrained minimization: a trust region subproblem on a subspace is solved in each iteration. We establish that the proposed algorithm has convergence properties analogous to those of the trust region algorithms for unconstrained minimization. Namely, every limit point of the generated sequence satisfies the Krush-Kuhn-Tucker (KKT) conditions and at least one limit point satisfies second order necessary optimality conditions. In addition, if one limit point is a strong local minimizer and the Hessian is Lipschitz continuous in a neighborhood of that point, then the generated sequence converges globally to that point in the rate of at least 2-step quadratic. We are mainly concerned with the theoretical properties of the algorithm in this paper. Implementation issues and adaptation to large-scale problems will be addressed in a 相似文献
14.
In this paper, we combine the nonmonotone and adaptive techniques with trust region method for unconstrained minimization problems. We set a new ratio of the actual descent and predicted descent. Then, instead of the monotone sequence, the nonmonotone sequence of function values are employed. With the adaptive technique, the radius of trust region △k can be adjusted automatically to improve the efficiency of trust region methods. By means of the Bunch-Parlett factorization, we construct a method with indefinite dogleg path for solving the trust region subproblem which can handle the indefinite approximate Hessian Bk. The convergence properties of the algorithm are established. Finally, detailed numerical results are reported to show that our algorithm is efficient. 相似文献
15.
提出了一类新的求解无约束最优化问题的新拟牛顿非单调信赖域算法.采用加权的r_k用以调整信赖域半径,在适当的条件下,证明了算法的全局收敛性.数值结果表明算法的有效性. 相似文献
16.
In this paper, a new trust region algorithm for unconstrained LC1 optimization problems is given. Compare with those existing trust regiion methods, this algorithm has a different feature: it obtains a stepsize at each iteration not by soloving a quadratic subproblem with a trust region bound, but by solving a system of linear equations. Thus it reduces computational complexity and improves computation efficiency. It is proven that this algorithm is globally convergent and locally superlinear under some conditions. 相似文献
17.
Hybridizing monotone and nonmonotone approaches, we employ a modified trust region ratio in which more information is provided about the agreement between the exact and the approximate models. Also, we use an adaptive trust region radius as well as two accelerated Armijo-type line search strategies to avoid resolving the trust region subproblem whenever a trial step is rejected. We show that the proposed algorithm is globally and locally superlinearly convergent. Comparative numerical experiments show practical efficiency of the proposed accelerated adaptive trust region algorithm. 相似文献
18.
本文提出了一种解无约束优化问题的新的非单调自适应信赖域方法.这种方法借助于目标函数的海赛矩阵的近似数量矩阵来确定信赖域半径.在通常的条件下,给出了新算法的全局收敛性以及局部超线性收敛的结果,数值试验验证了新的非单调方法的有效性. 相似文献
19.
《Optimization》2012,61(6):733-763
We present a non-monotone trust region algorithm for unconstrained optimization. Using the filter technique of Fletcher and Leyffer, we introduce a new filter acceptance criterion and use it to define reference iterations dynamically. In contrast with the early filter criteria, the new criterion ensures that the size of the filter is finite. We also show a correlation between problem dimension and the filter size. We prove the global convergence of the proposed algorithm to first- and second-order critical points under suitable assumptions. It is significant that the global convergence analysis does not require the common assumption of monotonicity of the sequence of objective function values in reference iterations, as assumed by the standard non-monotone trust region algorithms. Numerical experiments on the CUTEr problems indicate that the new algorithm is competitive compared to some representative non-monotone trust region algorithms. 相似文献