Add to ORKGIn this paper, we propose a line-search procedure for the logarithmic barrier function in the context of an interior point algorithm for convex quadratic programming. Preliminary testing shows that the proposed procedure is superior to some other linesearch methods developed specifically for the logarithmic barrier function in the literature
In order to solve the primal linear programming problems (and its dual) some methods have been used...
Abstract:- We present a filter line search sequential quadratic programming (SQP) method based on an...
A logarithmic barrier approach and its regularization applied to convex semi-infinite programming pr...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
This paper presents a comparative numerical study between line search methods and majorant functions...
This article is concerned with line-search procedures for a class of problems with certain nonlinear...
Besides the simplex algorithm, linear programs can also be solved via interior point methods. The th...
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The des...
This study examines two different barrier functions and their use in both path-following and potenti...
This study examines two different barrier functions and their use in both path-following and potenti...
There are many literatures in the field of interior point methods for exploring the properties of li...
Caption title.Includes bibliographical references.This research is partially supported by the U.S. A...
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If th...
this paper we have selected the primal-dual logarithmic barrier algorithm to present our ideas, beca...
In order to solve the primal linear programming problems (and its dual) some methods have been used...
Abstract:- We present a filter line search sequential quadratic programming (SQP) method based on an...
A logarithmic barrier approach and its regularization applied to convex semi-infinite programming pr...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
This paper presents a comparative numerical study between line search methods and majorant functions...
This article is concerned with line-search procedures for a class of problems with certain nonlinear...
Besides the simplex algorithm, linear programs can also be solved via interior point methods. The th...
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The des...
This study examines two different barrier functions and their use in both path-following and potenti...
This study examines two different barrier functions and their use in both path-following and potenti...
There are many literatures in the field of interior point methods for exploring the properties of li...
Caption title.Includes bibliographical references.This research is partially supported by the U.S. A...
This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If th...
this paper we have selected the primal-dual logarithmic barrier algorithm to present our ideas, beca...
In order to solve the primal linear programming problems (and its dual) some methods have been used...
Abstract:- We present a filter line search sequential quadratic programming (SQP) method based on an...
A logarithmic barrier approach and its regularization applied to convex semi-infinite programming pr...