Optimization Theory and Methods can be used as a textbook for an optimization course for
graduates and senior undergraduates. It is the result of the author's teaching and research …

This paper presents some fundamental results about sufficient linear weighted
complementarity problems. Such a problem depends on a nonnegative weight vector. If the …

Three interior point methods are proposed for sufficient horizontal linear complementarity
problems (HLCP): a large update path following algorithm, a first order corrector-predictor …

Two predictor–corrector methods of order m= Ω (log n) are proposed for solving sufficient
linear complementarity problems. The methods produce a sequence of iterates in the …

We present a new corrector-predictor method for solving sufficient linear complementarity
problems for which a sufficiently centered feasible starting point is available. In contrast with …

We deal with linear complementarity problems (LCPs) with P_*(κ) matrices. First we
establish the convergence rate of the complementary variables along the central path. The …

An interior point method for monotone linear complementarity problems acting in a wide
neighborhood of the central path is presented. The method has-iteration complexity and is …

A higher order corrector-predictor interior-point method is proposed for solving sufficient
linear complementarity problems. The algorithm produces a sequence of iterates in the ∞ …

Sufficient conditions are given for the Q-superlinear convergence of the iterates produced by
primal-dual interior-point methods for linear complementarity problems. It is shown that …

In this paper we propose a smoothing Newton-type algorithm for the problem of minimizing a
convex quadratic function subject to finitely many convex quadratic inequality constraints …