Mszros Csaba

Csaba Mszros

Information about the author Csaba Mszros will soon be added to the site.
Found 11 papers in total
On sparse matrix orderings in interior point methods
On sparse matrix orderings in interior point methods
2013
The major computational task of most interior point implementations is solving systems...
On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors
On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors
2005
The paper concerns the Cholesky factorization of symmetric positive semidefinite...
Sparsity in convex quadratic programming with interior point methods
Sparsity in convex quadratic programming with interior point methods
2006
In this paper, we investigate how the sparsity of non-separable quadratic programming...
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
Addendum to ‘Presolve analysis of linear programs prior to applying an interior point method’
2001
In this note we point out that the assumptions of Propositions 1 and 2 in Gondzio...
Steplengths in interior-point algorithms of quadratic programming
Steplengths in interior-point algorithms of quadratic programming
1999
An approach to determine primal and dual stepsizes in the infeasible-interior-point...
The role of the augmented system in interior point methods
The role of the augmented system in interior point methods
1998
We present a way to use the augmented system approach in interior point methods. We...
The augmented system variant of interior point methods in two-stage stochastic linear programming computation
The augmented system variant of interior point methods in two-stage stochastic linear programming computation
1997
The application of interior point methods to solve the deterministic equivalent of...
Group decision support on PC under MS Windows
Group decision support on PC under MS Windows
1994
WINGDSS is a flexible framework for group decision support, on PC-s in Microsoft...
On the modifications of the affine scaling algorithm for linear programming
On the modifications of the affine scaling algorithm for linear programming
1993
The most effective implementation of interior point methods for linear programming...
A numerically exact implementation of the simplex method
A numerically exact implementation of the simplex method
1995
The numerical performance of the state-of-the-art simplex based optimizers is good. At...
Basis inverse of large-scale and sparse linear programming problems
Basis inverse of large-scale and sparse linear programming problems
1992
This paper gives a brief survey on the methods for computing and updating the basis...
Papers per page: