Quadratic nonlinear optimization planners in a special case, its real objective function is a quadratic function, constraint functions are linear functions. Because of quadratic programming is relatively simple and easy to solve (after linear programming), and some non-linear optimization problem can be transformed into solving quadratic programming problems some columns, solving quadratic programming method therefore attracted attention earlier, saying an important way for solving nonlinear optimization. More quadratic programming algorithm, this paper describes only two feet Solving the Equality Constrained Convex Programming effective Lagrangian method and set method for solving general constrained convex quadratic programming.

求解二次规划问题的拉格朗日及有效集方法.doc
qlag.m
qpact.asv
qpact.m
qsubp.m
test.asv
test.m

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．