Note on error bounds for linear complementarity problems of Nekrasov matrices
Sign Up to like & getrecommendations! Published in 2019 at "Numerical Algorithms"
DOI: 10.1007/s11075-019-00685-y
Abstract: García-Esnaola and Peña (Numer. Algor. 67 , 655–667, 2014 ) presented an error bound involving a parameter for linear complementarity problems of Nekrasov matrices. This bound is not effective in some cases because it tends… read more here.
Keywords: linear complementarity; complementarity problems; error; problems nekrasov ... See more keywords
Backward errors of the linear complementarity problem
Sign Up to like & getrecommendations! Published in 2020 at "Numerical Algorithms"
DOI: 10.1007/s11075-019-00723-9
Abstract: In this paper, we define a backward error for the linear complementarity problem (LCP), and then present an expression of it which can be employed to examine the stability of algorithms solving the LCP. Some… read more here.
Keywords: linear complementarity; errors linear; complementarity problem; backward errors ... See more keywords
A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
Sign Up to like & getrecommendations! Published in 2020 at "Numerical Algorithms"
DOI: 10.1007/s11075-020-00954-1
Abstract: In this paper, for solving horizontal linear complementarity problems, a two-step modulus-based matrix splitting iteration method is established. The convergence analysis of the proposed method is presented, including the case of accelerated overrelaxation splitting. Numerical… read more here.
Keywords: linear complementarity; complementarity problems; step modulus; two step ... See more keywords
A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-1337-8
Abstract: This paper proposes a new second-order cone programming (SOCP) relaxation for convex quadratic programs with linear complementarity constraints. The new SOCP relaxation is derived by exploiting the technique that two positive semidefinite matrices can be… read more here.
Keywords: relaxation; linear complementarity; socp relaxation; complementarity constraints ... See more keywords
A class of new modulus-based matrix splitting methods for linear complementarity problem
Sign Up to like & getrecommendations! Published in 2021 at "Optimization Letters"
DOI: 10.1007/s11590-021-01781-6
Abstract: In this paper, to economically and fast solve the linear complementarity problem, based on a new equivalent fixed-point form of the linear complementarity problem, we establish a class of new modulus-based matrix splitting methods, which… read more here.
Keywords: complementarity problem; linear complementarity; method; modulus based ... See more keywords
An interior point method for $$P_{*}(\kappa )$$-horizontal linear complementarity problem based on a new proximity function
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Applied Mathematics and Computing"
DOI: 10.1007/s12190-019-01284-9
Abstract: Kernel functions play an important role in the design and complexity analysis of interior point algorithms for solving convex optimization problems. They determine both search directions and the proximity measure between the iterate and the… read more here.
Keywords: linear complementarity; interior point; kappa horizontal; horizontal linear ... See more keywords
New error bounds for linear complementarity problems of S-Nekrasov matrices and B–S-Nekrasov matrices
Sign Up to like & getrecommendations! Published in 2019 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-019-0818-4
Abstract: In this paper, we give new error bounds for linear complementarity problems when the involved matrices are S-Nekrasov matrices and B–S-Nekrasov matrices, respectively. We prove that the obtained bounds are better than those of Gao… read more here.
Keywords: nekrasov matrices; matrices nekrasov; linear complementarity; new error ... See more keywords
Scalar linear complementarity systems do not exhibit Zeno behavior
Sign Up to like & getrecommendations! Published in 2017 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2017.08.656
Abstract: Abstract This paper studies nature of solutions of scalar linear complementarity systems. The main result asserts that such systems do not exhibit Zeno behavior, that is there can only be finitely many switchings within any… read more here.
Keywords: linear complementarity; systems exhibit; exhibit zeno; complementarity systems ... See more keywords
A simple linear complementarity approach for sliding cable modeling considering friction
Sign Up to like & getrecommendations! Published in 2019 at "Mechanical Systems and Signal Processing"
DOI: 10.1016/j.ymssp.2019.05.012
Abstract: Abstract Sliding cable system with friction is encountered in many engineering applications. This system is typically characterized by existence of complex and diverse motion states of sliding nodes (pulleys), which leads to significant difficulties for… read more here.
Keywords: approach; friction; linear complementarity; sliding cable ... See more keywords
Solvability of a pseudodifferential linear complementarity problem related to a viscoelastodynamic contact model
Sign Up to like & getrecommendations! Published in 2018 at "Applicable Analysis"
DOI: 10.1080/00036811.2017.1376250
Abstract: Abstract This paper focus on a simplified viscoelastic problem subjected to unilateral boundary conditions. The problem is reduced to a pseudodifferential linear complementarity problem using Fourier techniques. Under appropriate regularity assumptions on the data, the… read more here.
Keywords: linear complementarity; solvability pseudodifferential; complementarity problem; pseudodifferential linear ... See more keywords
Exponential Time-Stepping Method for Linear Complementarity Systems
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Automatic Control"
DOI: 10.1109/tac.2022.3183041
Abstract: Linear complementarity system (LCS) consists of an ordinary differential equation (ODE) and a linear complementarity problem (LCP). In this article, we propose an exponential time-stepping method for solving LCS, which uses exponential integrator to discretize… read more here.
Keywords: linear complementarity; exponential time; complementarity; stepping method ... See more keywords