This paper presents a logarithmic barrier method for solving a semi-definite linear program. The descent direction is the classical Newton direction. We propose alternative ways to determine the step-size along the direction which are more efficient than classical line-searches
AbstractWe applied the modified barrier function (MBF) method and its new extensions to the linear p...
We present a generalization of the Penalty/Barrier Multiplier algorithm for the semidefinite program...
In this paper we present a generalization of the predictor corrector method of linear programming pr...
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The des...
This paper presents a comparative numerical study between line search methods and majorant functions...
We consider the construction of small step path following algorithms using volumetric, and mixed vol...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
There are many literatures in the field of interior point methods for exploring the properties of li...
We present generalization of Penalty/Barrier and Augmented Lagrangian algorithms for Semidefinite Pr...
To simplify the analysis of interior-point methods, one commonly formulates the problem so that the ...
A dual logarithmic barrier method for solving large, sparse semidefinite programs is proposed in thi...
The authors of this paper recently introduced a transformation that converts a class of semidefinite...
A logarithmic barrier approach and its regularization applied to convex semi-infinite programming pr...
Applying a higher order primal-dual logarithmic barrier method for solving large real-life linear pr...
This article is concerned with line-search procedures for a class of problems with certain nonlinear...
AbstractWe applied the modified barrier function (MBF) method and its new extensions to the linear p...
We present a generalization of the Penalty/Barrier Multiplier algorithm for the semidefinite program...
In this paper we present a generalization of the predictor corrector method of linear programming pr...
This paper presents a logarithmic barrier method for solving a semi-definite linear program. The des...
This paper presents a comparative numerical study between line search methods and majorant functions...
We consider the construction of small step path following algorithms using volumetric, and mixed vol...
In this paper, we propose a line-search procedure for the logarithmic barrier function in the contex...
There are many literatures in the field of interior point methods for exploring the properties of li...
We present generalization of Penalty/Barrier and Augmented Lagrangian algorithms for Semidefinite Pr...
To simplify the analysis of interior-point methods, one commonly formulates the problem so that the ...
A dual logarithmic barrier method for solving large, sparse semidefinite programs is proposed in thi...
The authors of this paper recently introduced a transformation that converts a class of semidefinite...
A logarithmic barrier approach and its regularization applied to convex semi-infinite programming pr...
Applying a higher order primal-dual logarithmic barrier method for solving large real-life linear pr...
This article is concerned with line-search procedures for a class of problems with certain nonlinear...
AbstractWe applied the modified barrier function (MBF) method and its new extensions to the linear p...
We present a generalization of the Penalty/Barrier Multiplier algorithm for the semidefinite program...
In this paper we present a generalization of the predictor corrector method of linear programming pr...
DOI
Add to ORKG