Ills Tibor

Tibor Ills

Information about the author Tibor Ills will soon be added to the site.
Found 12 papers in total
A polynomial path-following interior point algorithm for general linear complementarity problems
A polynomial path-following interior point algorithm for general linear complementarity problems
2010
Linear Complementarity Problems ( LCP s) belong to the class of NP -complete problems....
The Mizuno–Todd–Ye predictor–corrector algorithm for sufficient matrix linear complementarity problem
The Mizuno–Todd–Ye predictor–corrector algorithm for sufficient matrix linear complementarity problem
2005
We analyze a version of the Mizuno–Todd–Ye predictor–corrector...
New criss-cross type algorithms for linear complementarity problems with sufficient matrices
New criss-cross type algorithms for linear complementarity problems with sufficient matrices
2006
We generalize new criss-cross type algorithms for linear complementarity problems...
Entropy and Young programs: relations and self-concordance
Entropy and Young programs: relations and self-concordance
2002
In this paper we study a special class of linearly constrained problems with convex...
New variants of the criss-cross method for linearly constrained convex quadratic programming
New variants of the criss-cross method for linearly constrained convex quadratic programming
2004
In this paper, S. Zhang's new and more flexible criss-cross type algorithms (with LIFO...
New variants of the criss-cross method for linear complementarity problems with bisymmetric matrices
New variants of the criss-cross method for linear complementarity problems with bisymmetric matrices
2004
In this paper, S. Zhang's new and more flexible criss-cross type pivot rule is...
Pivot versus interior point methods: Pros and cons
Pivot versus interior point methods: Pros and cons
2002
Linear optimization (LO) is the fundamental problem of mathematical optimization. It...
A new and constructive proof of two basic results of linear programming
A new and constructive proof of two basic results of linear programming
2001
In this paper a new, elementary and constructive proof of Farkas' lemma is given. The...
The finite criss-cross method for hyperbolic programming
The finite criss-cross method for hyperbolic programming
1999
In this paper the finite criss-cross method is generalized to solve hyperbolic...
The finite criss-cross method for hyperbolic programming
The finite criss-cross method for hyperbolic programming
1996
In this paper the finite criss-cross method is generalized to solve hyperbolic...
Computational investigation of the covering number of finite projective planes with small order
Computational investigation of the covering number of finite projective planes with small order
1993
Our paper deals with Erdős’ problem related to the covering number of...
Pseudoconvex optimization for a special problem of paint industry
Pseudoconvex optimization for a special problem of paint industry
1994
A new mathematical programming model is presented for the computer color formulation...
Papers per page: