An Affine Scaling Interior Algorithm via Conjugate Gradient and Lanczos Methods for Bound-constrained Nonlinear Optimization†
نویسندگان
چکیده
In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.. AMS Mathematics Subject Classification : 90C30, 65K05.
منابع مشابه
On the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کاملTrust-region Quadratic Methods for Nonlinear Systems of Mixed Equalities and Inequalities
Two trust-region methods for systems of mixed nonlinear equalities, general inequalities and simple bounds are proposed. The first method is based on a Gauss-Newton model, the second one is based on a regularized Gauss-Newton model and results to be a Levenberg-Marquardt method. The globalization strategy uses affine scaling matrices arising in bound-constrained optimization. Global convergence...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملPolitecnico Di Torino Porto Institutional Repository [article] on Affine Scaling Inexact Dogleg Methods for Bound-constrained Nonlinear Systems on Affine Scaling Inexact Dogleg Methods for Bound-constrained Nonlinear Systems *
Within the framework of affine scaling trust-region methods for bound constrained problems, we discuss the use of a inexact dogleg method as a tool for simultaneously handling the trust-region and the bound constraints while seeking for an approximate minimizer of the model. Focusing on bound-constrained systems of nonlinear equations, an inexact affine scaling method for large scale problems, ...
متن کامل