Results 81 to 90 of about 2,842 (122)
Some of the next articles are maybe not open access.
A Semidefinite Relaxation Method for Linear and Nonlinear Complementarity Problems with Polynomials
Journal of the Operations Research Society of China, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Jin-Ling, Dai, Yue-Yang
openaire +1 more source
On semidefinite linear complementarity problems
Mathematical Programming, 2000The paper deals with the SemiDefinite Linear Complementarity Problem (SDLCP\((L,S^n_+)\): find a matrix \(X \in S^n_+\) such that \(Y=L(x)+Q \in S^n_+\) and and \(\langle X,Y\rangle=0\), where \(S^n\) (\(S^n_+\)) denote the set of symmetric (positive semidefinite) matrices, \(L: S^n \rightarrow S^n\) is a linear transformation, \(Q \in S^n\) and ...
Gowda, M. Seetharama, Song, Yoon
openaire +2 more sources
Characterizing -linear transformations for semidefinite linear complementarity problems
Nonlinear Analysis: Theory, Methods & Applications, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
López, Julio +2 more
openaire +3 more sources
Low-order penalty equations for semidefinite linear complementarity problems
Operations Research Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Chen, Luo, Ziyan, Xiu, Naihua
openaire +1 more source
Minimum norm solution to the positive semidefinite linear complementarity problem
Optimization, 2012In this article, we present an algorithm to compute the minimum norm solution of the positive semidefinite linear complementarity problem. We show that its solution can be obtained using the alternative theorems and a convenient characterization of the solution set of a convex quadratic programming problem.
Panos M. Pardalos +2 more
openaire +1 more source
On the Lipschitz Continuity of the Solution Map in Semidefinite Linear Complementarity Problems
Mathematics of Operations Research, 2005In this paper, we investigate the Lipschitz continuity of the solution map in semidefinite linear complementarity problems. For a monotone linear transformation defined on the space of real symmetric n × n matrices, we show that the Lipschitz continuity of the solution map implies the globally uniquely solvable (GUS)-property.
Balaji, R. +3 more
openaire +2 more sources
SIAM Journal on Optimization, 1997
Summary: The new polynomial affine scaling algorithm of Jansen, Roos and Terlaky for linear programming (LP) is extended to positive semidefinite linear complementarity problems. The algorithm is immediately further generalized to allow higher order scaling. These algorithms are also new for the LP case. The analysis is based on Ling's proof for the LP
Jansen, B., Roos, C., Terlaky, T.
openaire +2 more sources
Summary: The new polynomial affine scaling algorithm of Jansen, Roos and Terlaky for linear programming (LP) is extended to positive semidefinite linear complementarity problems. The algorithm is immediately further generalized to allow higher order scaling. These algorithms are also new for the LP case. The analysis is based on Ling's proof for the LP
Jansen, B., Roos, C., Terlaky, T.
openaire +2 more sources
Mathematical Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sim, Chee-Khian, Zhao, Gongyun
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sim, Chee-Khian, Zhao, Gongyun
openaire +3 more sources
A Newton-type method for positive-semidefinite linear complementarity problems
Journal of Optimization Theory and Applications, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Numerical Algorithms, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources