This paper addresses the local convergence properties of the affine-scaling interior-point algorithm for nonlinear programming. The analysis of local convergence is developed in terms of parameters that control the interior-point scheme and the size of the residual of the linear system that provides the step direction. The analysis follows the classical theory for quasi-Newton methods and addresses q-linear, q-superlinear, and q-quadratic rates of convergence.http://dx.doi.org/10.1023/A:100877492465
Abstract. In this work, we first study in detail the formulation of the primal-dual interior-point m...
Recently, various interior point algorithms - related to the Karmarkar algorithm - have been develo...
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first c...
. A class of affine-scaling interior-point methods for bound constrained optimization problems is in...
In this paper, we propose an infeasible-interior-point algorithm for linear programming based on the...
Abstract This paper analyzes local convergence rates of primal-dual interior point methods for gener...
We study the local convergence of a primal-dual interior point method for nonlinear programming. A l...
We develop and analyze a superlinearly convergent affine-scaling interior-point Newton method for in...
An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based o...
Abstract. In [3], two interior-point ℓ2-penalty methods with strong global convergence properties we...
We consider an interior point algorithm for convex programming in which the steps are generated by u...
International audienceIn this paper, we propose a modified primal-dual interior-point method for non...
It is now well established that, especially on large linear programming problems, the simplex method...
The affine scaling algorithm is one of the earliest interior point methods developed for linear prog...
In this paper we extend the well-known Boggs-Tolle-Wang characterization of Q-superlinear convergenc...
Abstract. In this work, we first study in detail the formulation of the primal-dual interior-point m...
Recently, various interior point algorithms - related to the Karmarkar algorithm - have been develo...
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first c...
. A class of affine-scaling interior-point methods for bound constrained optimization problems is in...
In this paper, we propose an infeasible-interior-point algorithm for linear programming based on the...
Abstract This paper analyzes local convergence rates of primal-dual interior point methods for gener...
We study the local convergence of a primal-dual interior point method for nonlinear programming. A l...
We develop and analyze a superlinearly convergent affine-scaling interior-point Newton method for in...
An algorithm for linear programming (LP) and convex quadratic programming (CQP) is proposed, based o...
Abstract. In [3], two interior-point ℓ2-penalty methods with strong global convergence properties we...
We consider an interior point algorithm for convex programming in which the steps are generated by u...
International audienceIn this paper, we propose a modified primal-dual interior-point method for non...
It is now well established that, especially on large linear programming problems, the simplex method...
The affine scaling algorithm is one of the earliest interior point methods developed for linear prog...
In this paper we extend the well-known Boggs-Tolle-Wang characterization of Q-superlinear convergenc...
Abstract. In this work, we first study in detail the formulation of the primal-dual interior-point m...
Recently, various interior point algorithms - related to the Karmarkar algorithm - have been develo...
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first c...