Search
Search Results
-
On the relation between affinely adjustable robust linear complementarity and mixed-integer linear feasibility problems
We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (SIAM J Optim 32:152–172, 2022) towards convex...
-
Error Bounds for Linear Complementarity Problems of Nekrasov and Generalized Nekrasov Matrices
We first propose a new error bound for the linear complementarity problems when the involved matrices are generalized Nekrasov matrices, which...
-
A Semidefinite Relaxation Method for Linear and Nonlinear Complementarity Problems with Polynomials
This paper considers semidefinite relaxation for linear and nonlinear complementarity problems. For some particular copositive matrices and tensors,...
-
A Fixed Point Iterative Method for Third-order Tensor Linear Complementarity Problems
Fixed point iterative approach for solving the third-order tensor linear complementarity problems (TLCP) is presented in this paper. Theoretical...
-
Convergence Analysis of the Projected SOR Iteration Method for Horizontal Linear Complementarity Problems
Recently, the projected Jacobi (PJ) and projected Gauss-Seidel (PGS) iteration methods have been studied for solving the horizontal linear...
-
A relaxed two-step modulus-based matrix synchronous multisplitting iteration method for linear complementarity problems
In this paper, a relaxed two-step modulus-based matrix synchronous multisplitting iteration method for solving the linear complementarity problems is...
-
New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems
We propose a new predictor–corrector interior-point algorithm for solving Cartesian symmetric cone horizontal linear complementarity problems, which...
-
On solving difference of convex functions programs with linear complementarity constraints
We address a large class of Mathematical Programs with Linear Complementarity Constraints which minimizes a continuously differentiable DC function...
-
On linear problems with complementarity constraints
A mathematical program with complementarity constraints is an optimization problem with equality/inequality constraints in which a complementarity...
-
A Two-Step Modulus-Based Matrix Splitting Iteration Method Without Auxiliary Variables for Solving Vertical Linear Complementarity Problems
In this paper, a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical...
-
Projected fixed-point method for vertical tensor complementarity problems
It is well known that the standard complementarity problem can be equivalently reformulated as a projected fixed-point equation, and this...
-
The Order-p Tensor Linear Complementarity Problem for Images Deblurring
In this paper, we first study the equivalence between the third order tensor linear complementarity problem under the framework of t-product and the...
-
Global error bounds for the extended vertical linear complementarity problems of CKV-type matrices and CKV-type B-matrices
Global error bounds for the extended vertical linear complementarity problems (EVLCP) of CKV-type matrices and CKV-type B -matrices are given. These...
-
Relaxations and cutting planes for linear programs with complementarity constraints
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not...
-
Complexity Analysis of a Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems
In this paper, we present a full-Newton step interior-point method for solving monotone Weighted Linear Complementarity Problem. We use the technique...
-
A New Ai–Zhang Type Interior Point Algorithm for Sufficient Linear Complementarity Problems
In this paper, we propose a new long-step interior point method for solving sufficient linear complementarity problems. The new algorithm combines...
-
Solvability of monotone tensor complementarity problems
The tensor complementarity problem is a special instance in the class of nonlinear complementarity problems, which has many applications in...
-
Convergence analysis of projected SOR iteration method for a class of vertical linear complementarity problems
Based on the ideas of the projected matrix splitting technique and the well-known successive overrelaxation (SOR) iteration method, a projected SOR...
-
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
We generalize a primal-dual interior-point algorithm (IPA) proposed recently in (Illés T, Rigó PR, Török R Unified approach of primal-dual...
-
Gradient projection method on the sphere, complementarity problems and copositivity
By using a constant step-size, the convergence analysis of the gradient projection method on the sphere is presented for a closed spherically convex...
