A pivoting algorithm solving linear complementarity problems
A matlab implementation of pivoting algorithm solving linear complementarity problems
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
LCPSolve(M,q) solves the linear complementarity problem:
w = M*z + q, w and z >= 0, w'*z = 0
The function takes the matrix M and the vector q as arguments. The function has three return variables. The first the vectors w and the second is the vector z, found by complementary pivoting. The third return is a 1 by 2 vector. The first component is a 1 if the algorithm was successful and a 2 if a ray termination resulted. The second component is the number of iterations performed in the outer loop.
We acknowledge the work LCPSolve.py in the OpenOpt python package by Rob Dittmar, Enzo Michelangeli and IT Vision Ltd
인용 양식
Andreas Almqvist (2026). A pivoting algorithm solving linear complementarity problems (https://kr.mathworks.com/matlabcentral/fileexchange/41485-a-pivoting-algorithm-solving-linear-complementarity-problems), MATLAB Central File Exchange. 검색 날짜: .
