Description: Quadratic programming problem can be described by the following form:. F (x) = (1/2) x ^ TQx+ ... if there is at least one vector x satisfies the constraints and f (x) in the feasible region bounded from below, quadratic programming questions have a global minimum x.
To Search:
File list (Check if you may need any files):
规划问题\fun1.m
........\funconstr.m
........\funfmins.m
........\funfminu.m
........\funrosen.m
........\rosen.m
........\优化问题实验.pps
规划问题
Download