In this work a Newton interior-point method for the solution of Karush-Kuhn-Tucker systems is presented. A crucial feature of this iterative method is the solution, at each iteration, of the inner subproblem. This sub...
详细信息
In this work a Newton interior-point method for the solution of Karush-Kuhn-Tucker systems is presented. A crucial feature of this iterative method is the solution, at each iteration, of the inner subproblem. This subproblem is a linear-quadratic programming problem, that can solved approximately by an inner iterative method such as the Hestenes multipliers' method. A deep analysis on the choices of the parameters of the method (perturbation and damping parameters) has been done. The global convergence of the Newton interior-point method is proved when it is viewed as an inexact Newton method for the solution of nonlinear systems with restriction on the sign of some variables. The Newton interior-point method is numerically evaluated on largescale test problems arising from elliptic optimal control problems which show the effectiveness of the approach. (c) 2004 Elsevier Inc. All rights reserved.
This paper is concerned with the numerical solution of a Karush-Kuhn-Tucker system. Such symmetric indefinite system arises when we solve a nonlinearprogramming problem by an Interior-Point (IP) approach. In this fra...
详细信息
This paper is concerned with the numerical solution of a Karush-Kuhn-Tucker system. Such symmetric indefinite system arises when we solve a nonlinearprogramming problem by an Interior-Point (IP) approach. In this framework, we discuss the effectiveness of two inner iterative solvers: the method of multipliers and the preconditioned conjugate gradient method. We discuss the implementation details of these algorithms in an IP scheme and we report the results of a numerical comparison on a set of largescale test-problems arising from the discretization of elliptic control problems.
This paper is concerned with the numerical solution of a Karush-Kuhn-Tucker system. Such symmetric indefinite system arises when we solve a nonlinearprogramming problem by an Interior-Point (IP) approach. In this fra...
详细信息
This paper is concerned with the numerical solution of a Karush-Kuhn-Tucker system. Such symmetric indefinite system arises when we solve a nonlinearprogramming problem by an Interior-Point (IP) approach. In this framework, we discuss the effectiveness of two inner iterative solvers: the method of multipliers and the preconditioned conjugate gradient method. We discuss the implementation details of these algorithms in an IP scheme and we report the results of a numerical comparison on a set of largescale test-problems arising from the discretization of elliptic control problems.
暂无评论