Polynomial interior-point algorithms for P*(K) horizontal linear complementarity problem

Authors:
G. Q. Wang;Y. Q. Bai
Affiliations:
College of Advanced Vocational Technology, Shanghai University of Engineering Science, Shanghai 200437, PR China and Department of Mathematics, Shanghai University, Shanghai 200444, PR China;Department of Mathematics, Shanghai University, Shanghai 200444, PR China
Venue:
Journal of Computational and Applied Mathematics
Year:
2009

Citing 14
Cited 3

Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem

Mathematics of Operations Research
The largest step path following algorithm for monotone linear complementarity problems

Mathematical Programming: Series A and B
Fast convergence of the simplified largest step path following algorithm

Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
Engineering and Economic Applications of Complementarity Problems

SIAM Review
Interior-point methods

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
Complementarity problems

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier

SIAM Journal on Optimization
Global convergence enhancement of classical linesearch interior point methods for MCPs

Journal of Computational and Applied Mathematics
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

SIAM Journal on Optimization
An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

SIAM Journal on Optimization
The convergence of a one-step smoothing Newton method for P0-NCP based on a new smoothing NCP-function

Journal of Computational and Applied Mathematics
A new large-update interior point algorithm for P*(κ) linear complementarity problems

Journal of Computational and Applied Mathematics
A polynomial-time algorithm for linear optimization based on a new class of kernel functions

Journal of Computational and Applied Mathematics
A matrix-splitting method for symmetric affine second-order cone complementarity problems

Journal of Computational and Applied Mathematics

Using vector divisions in solving the linear complementarity problem

Journal of Computational and Applied Mathematics
Polynomial interior-point algorithm for P*${(\kappa)}$ horizontal linear complementarity problems

Numerical Algorithms
A full-Newton step feasible interior-point algorithm for P*(κ)-linear complementarity problems

Journal of Global Optimization

Quantified Score

Hi-index	7.30

Visualization

Abstract

In this paper a class of polynomial interior-point algorithms for P"*(@k) horizontal linear complementarity problem based on a new parametric kernel function, with parameters p@?[0,1] and @s=1, are presented. The proposed parametric kernel function is not exponentially convex and also not strongly convex like the usual kernel functions, and has a finite value at the boundary of the feasible region. It is used both for determining the search directions and for measuring the distance between the given iterate and the @m-center for the algorithm. The currently best known iteration bounds for the algorithm with large- and small-update methods are derived, namely, O((1+2@k)nlognlogn@e) and O((1+2@k)nlogn@e), respectively, which reduce the gap between the practical behavior of the algorithms and their theoretical performance results. Numerical tests demonstrate the behavior of the algorithms for different results of the parameters p,@s and @q.