A gateway function to QPspline solver (without errorchecks)
R = mpt_call_qpspline(S)
S |
structure of the Opt class Class: struct |
S.H |
Quadratic part of the objective function which is strictly convex ![]() Class: double |
S.f |
Linear part of the objective function. Class: double |
S.A |
Linear part of the inequality constraints ![]() Class: double |
S.b |
Right hand side of the inequality constraints ![]() Class: double |
S.Ae |
Linear part of the equality constraints ![]() Class: double Default: [] |
S.be |
Right hand side of the equality constraints ![]() Class: double Default: [] |
S.lb |
Lower bound for the variables ![]() Class: double Default: [] |
S.ub |
Upper bound for the variables ![]() Class: double Default: [] |
S.n |
Problem dimension (number of variables). Class: double |
S.m |
Number of inequalities in ![]() Class: double |
S.me |
Number of equalities in ![]() Class: double |
S.problem_type |
A string specifying the problem to be solved. Class: char |
S.test |
Call (false) or not to call (true) MPT global settings. Class: logical Default: false |
R |
result structure Class: struct |
R.xopt |
Optimal solution. Class: double |
R.obj |
Optimal objective value. Class: double |
R.lambda |
Lagrangian multipliers Class: double |
R.exitflag |
An integer value that informs if the result was feasible (1), or otherwise (different from 1). Class: double |
R.how |
A string that informs if the result was feasible ('ok'), or if any problem appeared through optimization. Class: char |
◀ | mpt_call_plcp | mpt_call_linprog | ▶ |
© 2010-2013 Martin Herceg: ETH Zurich, herceg@control.ee.ethz.ch