Results 41 to 50 of about 8,622,101 (70)

Relationship between strong monotonicity property, P₂-property, and the GUS-property in semidefinite linear complementarity problems

, 2002
In a recent paper on semidefinite linear complementarity problems, Gowda and Song (2000) introduced and studied the P-property, P2-property, GUS-property, and strong monotonicity property for linear transformation L: Sn → Sn, where Sn is the space of all
Sriparna, B., Sampangi Raman, D., Parthasarathy, T.   +2 more
core   +1 more source

MULTIPLE OPTIMAL SOLUTIONS IN QUADRATIC PROGRAMMING MODELS [PDF]

The problem of determining whether quadratic programming models possess either unique or multiple optimal solutions is important for empirical analyses which use a mathematical programming framework.
Paris, Quirino
core  

Nonsmooth Newton’s Method and Semidefinite Optimization [PDF]

, 2003
We introduce basic ideas of a nonsmooth Newton’s method and its application in solving semidefinite optimization (SDO) problems. In particular, the method can be used to solve both linear and nonlinear semidefinite complementarity problems.
Sun, Jie
core  

On the solution sets of linear complementarity problems

, 2000
In this article we consider two problems related to the solution sets of linear complementarity problems (LCPs)-one on the connectedness and the other on the convexity. In Jones and Gowda [ Linear Algebra Appl., 246 (1996), pp.
Sriparna, B., Parthasarathy, T., Murthy, G. S. R.   +2 more
core   +1 more source

Computing Integral Solutions of Complementarity Problems [PDF]

AMS classifications: 90C33, 90C26, 91B50.Discrete set;complementarity problem;algorithm ...
Laan, G. van der, Yang, Z.F., Talman, A.J.J.   +2 more
core  

Improved algorithms for linear complementarity problems arising from collision response

, 2001
In this paper we give algorithms for solving linear complementarity problems for $\mathcal{P}$-matrices and symmetric positive semidefinite matrices. Our approach of the problem turns out to be an improvement and a more precise formulation of Baraff’s ...
El Kahoui, M.
core  

Optimization with Semidefinite, Quadratic and Linear Constraints

, 1997
We consider optimization problems where variables have either linear, or convex quadratic or semidefinite constraints. First, we define and characterize primal and dual nondegeneracy and strict complementarity conditions.
F. Alizadeh, S. H. Schmieta
core  

An Infeasible-Interior-Point Algorithm for Linear Complementarity Problems

, 1992
In this paper, we discuss a polynomial and Q-subquadratically convergent algorithm for linear complementarity problems that does not require feasibility of the initial point or the subsequent iterates.
Stephen Wright
core  

Matrix convex functions with applications to weighted centers for semidefinite programming [PDF]

In this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s.
Zhang, S., Luo, Z-Q., Brinkhuis, J.
core  

An Application of the Khachian-Shor Algorithm to a Class of Linear Complementary Problems [PDF]

The recent ellipsoidal method for solving linear programs due to Khachian and Shor is shown to process linear complementarity problems with positive semidefinite matrix.
Richard P. McLean, J. Scott Provan, Ilan Adler   +2 more
core