Description: Through the classic Lemke complementarity algorithm shaft containing the convex equality constrained quadratic programming problem of the analysis, we found by the linear complementarity problem (lcp) may be degraded. Algorithm by Lemke (lcp) of the iterative process of questions, through the six propositions that contain equality constraints of convex quadratic programming problem corresponding to (lcp) questions the reasons for degradation of the classic Lemke algorithm iterative process amendments put forward an improved Lemke algorithm can effectively containing english convex equality constrained quadratic programming problem of the optimal solution.
- [donlp2_ansi_c.tar] - sqp package. Sqp used algorithm of nonli
- [mathmodel] - This a good model to study the informati
- [quadraticprograming] - Calculation of inequality constrained qu
- [SQP__] - an modern SQP method to make the origina
- [AS] - The MATLAB program for the solution of o
- [1] - Solving Variational Inequalities in Engl
- [2007961189086942230] - bvggtrrgenjhtytrf
- [QuadProg] - a C++ implementing algorithm for a (conv
- [semi2M] - semi-smooth newton method for image rest
- [BasicPSO] - Foreign particle swarm optimization prog
File list (Check if you may need any files):
new_sqp
.......\n_sqp.m
Download