Results 21 to 30 of about 91,873 (257)

A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems [PDF]

Yugoslav Journal of Operations Research, 2015
In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is
Asadi S., Mansouri H.
doaj   +1 more source

A new search direction of IPM for horizontal linear complementarity problems

Frontiers in Energy Research, 2023
This study presents a new search direction for the horizontal linear complementarity problem. A vector-valued function is applied to the system of xy=μe, which defines the central path.
Xiaoyu Gong, Xiaoyu Gong, Lei Xi, Lei Xi, Bo Yuan   +4 more
doaj   +1 more source

A new error bound for linear complementarity problems involving $ B- $matrices

AIMS Mathematics, 2023
In this paper, a new error bound for the linear complementarity problems of $ B- $matrices which is a subclass of the $ P- $matrices is presented. Theoretical analysis and numerical example illustrate that the new error bound improves some existing ...
Hongmin Mo , Yingxue Dong
doaj   +1 more source

Nonsmooth Levenberg-Marquardt Type Method for Solving a Class of Stochastic Linear Complementarity Problems with Finitely Many Elements

Algorithms, 2016
Our purpose of this paper is to solve a class of stochastic linear complementarity problems (SLCP) with finitely many elements. Based on a new stochastic linear complementarity problem function, a new semi-smooth least squares reformulation of the ...
Zhimin Liu, Shouqiang Du, Ruiying Wang
doaj   +1 more source

Accelerated double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems

Results in Applied Mathematics, 2022
This paper is concerned with solving linear complementarity problems (LCP) arising in many scientific and engineering fields. We propose an accelerated double-relaxation two-sweep modulus-based matrix splitting (ADRTMMS) iteration method by applying ...
Zhengge Huang, Jingjing Cui
doaj   +1 more source

Linear complementarity problems on extended second order cones [PDF]

, 2018
In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant.
Németh, S. Z., Xiao, L.
core   +2 more sources

Error bounds for linear complementarity problems of SDD₁ matrices and SDD₁-B matrices

AIMS Mathematics, 2022
An upper bound of the infinity norm for the inverse of $ SD{D_1} $ matrix is presented. We apply the new bound to linear complementarity problems (LCPs) and obtain an alternative error bound for LCPs of $ SD{D_1} $ matrices and $ SD{{D}_{1}} $-$ B ...
Yingxia Zhao, Lanlan Liu, Feng Wang
doaj   +1 more source

A Penalized-Equation-Based Generalized Newton Method for Solving Absolute-Value Linear Complementarity Problems

Journal of Mathematics, 2014
We consider a class of absolute-value linear complementarity problems. We propose a new approximation reformulation of absolute value linear complementarity problems by using a nonlinear penalized equation.
Yuan Li, Hai-Shan Han, Dan-Dan Yang
doaj   +1 more source

Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems

Croatian Operational Research Review, 2016
We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj   +1 more source

Verification of Solutions for Almost Linear Complementarity Problems [PDF]

, 2006
We present a computational enclosure method for the solution of a class of nonlinear complementarity problems.
, Wang, Zhengyu
core   +1 more source