Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal and dual variables. The centrality condition is a relaxation of the perturbed Karush-Kuhn-Tucker condition and primarily forces feasibility in the constraints. In order to globalize the method using a linesearch strategy, a modified augmented Lagrangian merit function is defined in terms of the centrality condition. The second class is the Quasi-Newton interior-point methods. In this class the well known Boggs-Tolle-Wang characterization of Q-superlinear convergence for Quasi-Newton method for equality constrained optimiz...
Abstract An exact-penalty-function-based scheme--inspired from an old idea due to Mayne and Polak (M...
Recently primal-dual interior-point methodology has proven to be an effective tool in linear program...
robust primal-dual interior point algorithm for nonlinear programs ∗ Xinwei Liu†and Jie Sun‡ Abstrac...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/1...
In this paper we extend the well-known Boggs-Tolle-Wang characterization of Q-superlinear convergenc...
Abstract This paper analyzes local convergence rates of primal-dual interior point methods for gener...
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...
A primal-dual interior point algorithm for solving general nonlinear programming problems is present...
In this work we consider a linesearch globalization of the local primal-dual interior-point Newton m...
In this work we first study in detail the formulation of the primal-dual interior-point method for l...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/1...
We study the local convergence of a primal-dual interior point method for nonlinear programming. A l...
In the first part of this research we consider a linesearch globalization of the local primal-dual i...
In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming p...
Abstract An exact-penalty-function-based scheme--inspired from an old idea due to Mayne and Polak (M...
Recently primal-dual interior-point methodology has proven to be an effective tool in linear program...
robust primal-dual interior point algorithm for nonlinear programs ∗ Xinwei Liu†and Jie Sun‡ Abstrac...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/1...
In this paper we extend the well-known Boggs-Tolle-Wang characterization of Q-superlinear convergenc...
Abstract This paper analyzes local convergence rates of primal-dual interior point methods for gener...
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...
A primal-dual interior point algorithm for solving general nonlinear programming problems is present...
In this work we consider a linesearch globalization of the local primal-dual interior-point Newton m...
In this work we first study in detail the formulation of the primal-dual interior-point method for l...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/1...
We study the local convergence of a primal-dual interior point method for nonlinear programming. A l...
In the first part of this research we consider a linesearch globalization of the local primal-dual i...
In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming p...
Abstract An exact-penalty-function-based scheme--inspired from an old idea due to Mayne and Polak (M...
Recently primal-dual interior-point methodology has proven to be an effective tool in linear program...
robust primal-dual interior point algorithm for nonlinear programs ∗ Xinwei Liu†and Jie Sun‡ Abstrac...