In this paper, we provide a counter example for a successful method, i.e. IMP-BOT method [6], based on ODE for unconstrained optimization. And we obtainthat methods based on BDF and the general trapezoidal metod for u...In this paper, we provide a counter example for a successful method, i.e. IMP-BOT method [6], based on ODE for unconstrained optimization. And we obtainthat methods based on BDF and the general trapezoidal metod for unconstrainedoptimization is bad efficient because these methods even if have A stability, not Lstability.展开更多
This paper presents a new class of quasi-Newton methods for solving unconstrained minimization problems. The methods can be regarded as a generalization of Huang class of quasi-Newton methods. We prove that the direct...This paper presents a new class of quasi-Newton methods for solving unconstrained minimization problems. The methods can be regarded as a generalization of Huang class of quasi-Newton methods. We prove that the directions and the iterations generated by the methods of the new class depend only on the parameter p if the exact line searches are made in each steps.展开更多
In this paper, a new Wolfe-type line search and a new Armijo-type line searchare proposed, and some global convergence properties of a three-term conjugate gradient method withthe two line searches are proved.
In this paper,we propose an improved trust region method for solving unconstrained optimization problems.Different with traditional trust region methods,our algorithm does not resolve the subproblem within the trust r...In this paper,we propose an improved trust region method for solving unconstrained optimization problems.Different with traditional trust region methods,our algorithm does not resolve the subproblem within the trust region centered at the current iteration point,but within an improved one centered at some point located in the direction of the negative gradient,while the current iteration point is on the boundary set.We prove the global convergence properties of the new improved trust region algorithm and give the computational results which demonstrate the effectiveness of our algorithm.展开更多
文摘In this paper, we provide a counter example for a successful method, i.e. IMP-BOT method [6], based on ODE for unconstrained optimization. And we obtainthat methods based on BDF and the general trapezoidal metod for unconstrainedoptimization is bad efficient because these methods even if have A stability, not Lstability.
文摘This paper presents a new class of quasi-Newton methods for solving unconstrained minimization problems. The methods can be regarded as a generalization of Huang class of quasi-Newton methods. We prove that the directions and the iterations generated by the methods of the new class depend only on the parameter p if the exact line searches are made in each steps.
基金This research is supported by the National Natural Science Foundation of China(10171055).
文摘In this paper, a new Wolfe-type line search and a new Armijo-type line searchare proposed, and some global convergence properties of a three-term conjugate gradient method withthe two line searches are proved.
基金supported by National Natural Science Foundation of China(Grant Nos.60903088 and 11101115)the Natural Science Foundation of Hebei Province(Grant No.A2010000188)Doctoral Foundation of Hebei University(Grant No.2008136)
文摘In this paper,we propose an improved trust region method for solving unconstrained optimization problems.Different with traditional trust region methods,our algorithm does not resolve the subproblem within the trust region centered at the current iteration point,but within an improved one centered at some point located in the direction of the negative gradient,while the current iteration point is on the boundary set.We prove the global convergence properties of the new improved trust region algorithm and give the computational results which demonstrate the effectiveness of our algorithm.
