Solving the Linear Complementarity Problem in Circuit Simulation

DOI10.1137/0324062MaRDI QIDQ4721879zbMATH OpenOpenAlexFDO

Authors Jos T. J. van Eijndhoven

Publication date 1986

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0324062

zbMATH Keywords

efficient labelling algorithmmodulus algorithmpiecewise linear system descriptionpivoting algorithmssequence of linear complementarity problemssparse matrix techniques

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Large-scale problems in mathematical programming (90C06) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 778140
• A finite improvement algorithm for the linear complementarity problem
• On linear dynamic complementary systems
• Iterative algorithms for the linear complementarity problem
• scientific article; zbMATH DE number 653034

Cited in

(8)

• A note on a quadratic formulation for linear complementarity problems
• A dual exact penalty formulation for the linear complementarity problem
• The linear complementarity problem as a separable bilinear program
• Tensor complementarity problems. III: Applications
• On linear dynamic complementary systems
• scientific article; zbMATH DE number 7113016 (Why is no real title available?)
• Progress in the solving of a circuit design problem
• Sign-solvable linear complementarity problems

This page was built for publication: Solving the Linear Complementarity Problem in Circuit Simulation

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