Sparse Linear Complementarity Problems

DOI10.1007/978-3-642-38233-8_30MaRDI QIDQ4924665zbMATH OpenOpenAlexFDO

Authors Hanna Sumita, Naonori Kakimura, Kazuhisa Makino

Publication date 7 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38233-8_30

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Sparse solutions of linear complementarity problems
• Sparse linear least squares problems in optimization
• scientific article; zbMATH DE number 4041162
• Sparse linear problems and the least squares method
• Parameterized complexity of sparse linear complementarity problems
• Parameterized complexity of sparse linear complementarity problems
• Sparse solutions of underdetermined linear systems
• Sparse Approximate Solutions to Linear Systems
• Sparse Solutions of Underdetermined Linear Systems and Their Applications
• scientific article; zbMATH DE number 1153374

Cited in

(7)

• Parameterized complexity of sparse linear complementarity problems
• The Linear Complementarity Problems with a Few Variables per Constraint
• Sparse Compression of Expected Solution Operators
• Parameterized complexity of sparse linear complementarity problems
• Sign-Solvable Linear Complementarity Problems
• scientific article; zbMATH DE number 7668284 (Why is no real title available?)
• Sign-solvable linear complementarity problems

This page was built for publication: Sparse Linear Complementarity Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924665)