Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 220,299,689 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

1998

Highly Cited

1998

Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems…

Highly Cited

1998

Highly Cited

1998

This paper establishes convergence of generalized Bregman-function-based proximal point algorithms when the iterates are computed…

1998

1998

In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum…

Highly Cited

1997

Highly Cited

1997

Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty…

Highly Cited

1997

Highly Cited

1997

We analyze the complexity of the analytic center cutting plane or column generation algorithm for solving general convex problems…

Highly Cited

1997

Highly Cited

1997

We describe an algorithm for solving the equicut problem on complete graphs. The core of the algorithm is a cutting-plane…

1997

1997

This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for…

1997

1997

In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensional polyhedra. The presence…

1997

1997

Because of the many important applications of quadratic programming, fast and efficient methods for solving quadratic programming…

Review

1977

Review

1977

History of mathematical programming systems.- Scope of mathematical programming software.- Anatomy of a mathematical programming…