On the complexity of computing the handicap of a sufficient matrix
From MaRDI portal
Publication:644911
DOI10.1007/s10107-011-0465-zzbMath1226.90121MaRDI QIDQ644911
Etienne de Klerk, Marianna. E.-Nagy
Publication date: 7 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0465-z
90C22: Semidefinite programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Sufficient weighted complementarity problems, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, Column sufficient tensors and tensor complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Determining the handicap of a sufficient matrix
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Co-NP-completeness of some matrix classification problems
- On a subclass of \(P_ 0\)
- \(P_ *\)-matrices are just sufficient
- Sign reversing and matrix classes
- Quadratic programming is in NP
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- Global Optimization with Polynomials and the Problem of Moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
