quadprog

Quadratic programming

Syntax

x = quadprog(H,f)

x = quadprog(H,f,A,b)

x = quadprog(H,f,A,b,Aeq,beq)

x = quadprog(H,f,A,b,Aeq,beq,lb,ub)

x = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0)

x = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0,options)

x = quadprog(problem)

[x,fval] = quadprog(___)

[x,fval,exitflag,output] = quadprog(___)

[x,fval,exitflag,output,lambda] = quadprog(___)

[wsout,fval,exitflag,output,lambda] = quadprog(H,f,A,b,Aeq,beq,lb,ub,ws)

Description

Solver for quadratic objective functions with linear constraints.

quadprog finds a minimum for a problem specified by

$$\underset{x}{\min }\frac{1}{2}{x}^{T}Hx+f^{T}x\text{ such that }\{\begin{array}{c}A\cdot x\le b,\\ Aeq\cdot x=beq,\\ lb\le x\le ub.\end{array}$$

H, A, and Aeq are matrices, and f, b, beq, lb, ub, and x are vectors.

You can pass f, lb, and ub as vectors or matrices; see Matrix Arguments.

Note

quadprog applies only to the solver-based approach. Use solve for the problem-based approach. For a discussion of the two optimization approaches, see First Choose Problem-Based or Solver-Based Approach.

x = quadprog(H,f) returns a vector x that minimizes 1/2*x'*H*x + f'*x. The input H must be positive definite for the problem to have a finite minimum. If H is positive definite, then the solution x = H\(-f).

x = quadprog(H,f,A,b) minimizes 1/2*x'*H*x + f'*x subject to the restrictions A*x ≤ b. The input A is a matrix of doubles, and b is a vector of doubles.

x = quadprog(H,f,A,b,Aeq,beq) solves the preceding problem subject to the additional restrictions Aeq*x = beq. Aeq is a matrix of doubles, and beq is a vector of doubles. If no inequalities exist, set A = [] and b = [].

x = quadprog(H,f,A,b,Aeq,beq,lb,ub) solves the preceding problem subject to the additional restrictions lb ≤ x ≤ ub. The inputs lb and ub are vectors of doubles, and the restrictions hold for each x component. If no equalities exist, set Aeq = [] and beq = [].

Note

If the specified input bounds for a problem are inconsistent, the output x is x0 and the output fval is [].

quadprog resets components of x0 that violate the bounds lb ≤ x ≤ ub to the interior of the box defined by the bounds. quadprog does not change components that respect the bounds.

x = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0) solves the preceding problem starting from the vector x0. If no bounds exist, set lb = [] and ub = []. Some quadprog algorithms ignore x0; see x0.

Note

x0 is a required argument for the 'active-set' algorithm.

x = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0,options) solves the preceding problem using the optimization options specified in options. Use optimoptions to create options. If you do not want to give an initial point, set x0 = [].

x = quadprog(problem) returns the minimum for problem, a structure described in problem. Create the problem structure using dot notation or the struct function. Alternatively, create a problem structure from an OptimizationProblem object by using prob2struct.

[x,fval] = quadprog(___), for any input variables, also returns fval, the value of the objective function at x:

fval = 0.5*x'*H*x + f'*x

[x,fval,exitflag,output] = quadprog(___) also returns exitflag, an integer that describes the exit condition of quadprog, and output, a structure that contains information about the optimization.

[x,fval,exitflag,output,lambda] = quadprog(___) also returns lambda, a structure whose fields contain the Lagrange multipliers at the solution x.

[wsout,fval,exitflag,output,lambda] = quadprog(H,f,A,b,Aeq,beq,lb,ub,ws) starts quadprog from the data in the warm start object ws, using the options in ws. The returned argument wsout contains the solution point in wsout.X. By using wsout as the initial warm start object in a subsequent solver call, quadprog can work faster.

Examples

Quadratic Program with Linear Constraints

Find the minimum of

$$f(x)=\frac{1}{2}{x}_1^2+x_2^2-x_1{x}_2-2x_1-6x_2$$

subject to the constraints

$$\begin{array}{l}{x}_1+x_2\le 2\\ -x_1+2x_2\le 2\\ 2x_1+x_2\le 3.\end{array}$$

In quadprog syntax, this problem is to minimize

$$f(x)=\frac{1}{2}{x}^{T}Hx+f^{T}x$$,

where

$$\begin{array}{l}\mathit{H}=\left[\begin{array}{cc}1& -1\\ -1& 2\end{array}\right]\\ \mathit{f}=\left[\begin{array}{c}-2\\ -6\end{array}\right],\end{array}$$

subject to the linear constraints.

To solve this problem, first enter the coefficient matrices.

H = [1 -1; -1 2]; 
f = [-2; -6];
A = [1 1; -1 2; 2 1];
b = [2; 2; 3];

Call quadprog.

[x,fval,exitflag,output,lambda] = ...
   quadprog(H,f,A,b);

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

Examine the final point, function value, and exit flag.

x,fval,exitflag

x = 2×1

    0.6667
    1.3333

fval = 
-8.2222

exitflag = 
1

An exit flag of 1 means the result is a local minimum. Because H is a positive definite matrix, this problem is convex, so the minimum is a global minimum.

Confirm that H is positive definite by checking its eigenvalues.

eig(H)

ans = 2×1

    0.3820
    2.6180

Quadratic Program with Linear Equality Constraint

Find the minimum of

$$f(x)=\frac{1}{2}{x}_1^2+x_2^2-x_1{x}_2-2x_1-6x_2$$

subject to the constraint

$$x_1+x_2=0.$$

In quadprog syntax, this problem is to minimize

$$f(x)=\frac{1}{2}{x}^{T}Hx+f^{T}x$$,

where

$$\begin{array}{l}\mathit{H}=\left[\begin{array}{cc}1& -1\\ -1& 2\end{array}\right]\\ \mathit{f}=\left[\begin{array}{c}-2\\ -6\end{array}\right],\end{array}$$

subject to the linear constraint.

To solve this problem, first enter the coefficient matrices.

H = [1 -1; -1 2]; 
f = [-2; -6];
Aeq = [1 1];
beq = 0;

Call quadprog, entering [] for the inputs A and b.

[x,fval,exitflag,output,lambda] = ...
   quadprog(H,f,[],[],Aeq,beq);

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

Examine the final point, function value, and exit flag.

x,fval,exitflag

x = 2×1

   -0.8000
    0.8000

fval = 
-1.6000

exitflag = 
1

An exit flag of 1 means the result is a local minimum. Because H is a positive definite matrix, this problem is convex, so the minimum is a global minimum.

Confirm that H is positive definite by checking its eigenvalues.

eig(H)

ans = 2×1

    0.3820
    2.6180

Quadratic Minimization with Linear Constraints and Bounds

Find the x that minimizes the quadratic expression

$$\frac{1}{2}{x}^{T}Hx+f^{T}x$$

where

$\mathit{H}=\left[\begin{array}{ccc}1& -1& 1\\ -1& 2& -2\\ 1& -2& 4\end{array}\right]$, $\mathit{f}=\left[\begin{array}{c}2\\ -3\\ 1\end{array}\right]$,

subject to the constraints

$$0\le x\le 1$$, $$\sum x=1/2$$.

To solve this problem, first enter the coefficients.

H = [1,-1,1
    -1,2,-2
    1,-2,4];
f = [2;-3;1];
lb = zeros(3,1);
ub = ones(size(lb));
Aeq = ones(1,3);
beq = 1/2;

Call quadprog, entering [] for the inputs A and b.

x = quadprog(H,f,[],[],Aeq,beq,lb,ub)

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

x = 3×1

    0.0000
    0.5000
    0.0000

Quadratic Minimization with Nondefault Options

Set options to monitor the progress of quadprog.

options = optimoptions('quadprog','Display','iter');

Define a problem with a quadratic objective and linear inequality constraints.

H = [1 -1; -1 2]; 
f = [-2; -6];
A = [1 1; -1 2; 2 1];
b = [2; 2; 3];

To help write the quadprog function call, set the unnecessary inputs to [].

Aeq = [];
beq = [];
lb = [];
ub = [];
x0 = [];

Call quadprog to solve the problem.

x = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0,options)

 Iter            Fval  Primal Infeas    Dual Infeas  Complementarity  
    0   -8.884885e+00   3.214286e+00   1.071429e-01     1.000000e+00  
    1   -8.331868e+00   1.321041e-01   4.403472e-03     1.910489e-01  
    2   -8.212804e+00   1.676295e-03   5.587652e-05     1.009601e-02  
    3   -8.222204e+00   8.381476e-07   2.793826e-08     1.809485e-05  
    4   -8.222222e+00   4.190781e-11   1.396827e-12     9.047989e-10  

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

x = 2×1

    0.6667
    1.3333

Quadratic Problem from prob2struct

Create a problem structure using a Problem-Based Optimization Workflow. Create an optimization problem equivalent to Quadratic Program with Linear Constraints.

x = optimvar('x',2);
objec = x(1)^2/2 + x(2)^2 - x(1)*x(2) - 2*x(1) - 6*x(2);
prob = optimproblem('Objective',objec);
prob.Constraints.cons1 = sum(x) <= 2;
prob.Constraints.cons2 = -x(1) + 2*x(2) <= 2;
prob.Constraints.cons3 = 2*x(1) + x(2) <= 3;

Convert prob to a problem structure.

problem = prob2struct(prob);

Solve the problem using quadprog.

[x,fval] = quadprog(problem)

Warning: Your Hessian is not symmetric. Resetting H=(H+H')/2.

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

x = 2×1

    0.6667
    1.3333

fval = 
-8.2222

Return quadprog Objective Function Value

Solve a quadratic program and return both the solution and the objective function value.

H = [1,-1,1
    -1,2,-2
    1,-2,4];
f = [-7;-12;-15];
A = [1,1,1];
b = 3;
[x,fval] = quadprog(H,f,A,b)

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

x = 3×1

   -3.5714
    2.9286
    3.6429

fval = 
-47.1786

Check that the returned objective function value matches the value computed from the quadprog objective function definition.

fval2 = 1/2*x'*H*x + f'*x

fval2 = 
-47.1786

Examine quadprog Optimization Process

To see the optimization process for quadprog, set options to show an iterative display and return four outputs. The problem is to minimize

$$\frac{1}{2}{x}^{T}Hx+f^{T}x$$

subject to

$$0\le x\le 1$$,

where

$\mathit{H}=\left[\begin{array}{ccc}2& 1& -1\\ 1& 3& \frac{1}{2}\\ -1& \frac{1}{2}& 5\end{array}\right]$, $\mathit{f}=\left[\begin{array}{c}4\\ -7\\ 12\end{array}\right]$.

Enter the problem coefficients.

H = [2 1 -1
    1 3 1/2
    -1 1/2 5];
f = [4;-7;12];
lb = zeros(3,1);
ub = ones(3,1);

Set the options to display iterative progress of the solver.

options = optimoptions('quadprog','Display','iter');

Call quadprog with four outputs.

[x fval,exitflag,output] = quadprog(H,f,[],[],[],[],lb,ub,[],options)

 Iter            Fval  Primal Infeas    Dual Infeas  Complementarity  
    0    2.691769e+01   1.582123e+00   1.712849e+01     1.680447e+00  
    1   -3.889430e+00   0.000000e+00   8.564246e-03     9.971731e-01  
    2   -5.451769e+00   0.000000e+00   4.282123e-06     2.710131e-02  
    3   -5.499995e+00   0.000000e+00   2.878422e-10     1.750743e-06  
    4   -5.500000e+00   0.000000e+00   1.454808e-13     8.753723e-10  

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

x = 3×1

    0.0000
    1.0000
    0.0000

fval = 
-5.5000

exitflag = 
1

output = struct with fields:
            message: 'Minimum found that satisfies the constraints.↵↵Optimization completed because the objective function is non-decreasing in ↵feasible directions, to within the value of the optimality tolerance,↵and constraints are satisfied to within the value of the constraint tolerance.↵↵<stopping criteria details>↵↵Optimization completed: The relative dual feasibility, 1.212340e-14,↵is less than options.OptimalityTolerance = 1.000000e-08, the complementarity measure,↵8.753723e-10, is less than options.OptimalityTolerance, and the relative maximum constraint↵violation, 0.000000e+00, is less than options.ConstraintTolerance = 1.000000e-08.'
          algorithm: 'interior-point-convex'
      firstorderopt: 2.3577e-09
    constrviolation: 0
         iterations: 4
       linearsolver: 'dense'
       cgiterations: []

Return quadprog Lagrange Multipliers

Solve a quadratic programming problem and return the Lagrange multipliers.

H = [1,-1,1
    -1,2,-2
    1,-2,4];
f = [-7;-12;-15];
A = [1,1,1];
b = 3;
lb = zeros(3,1);
[x,fval,exitflag,output,lambda] = quadprog(H,f,A,b,[],[],lb);

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

Examine the Lagrange multiplier structure lambda.

disp(lambda)

    ineqlin: 12.0000
      eqlin: [0×1 double]
      lower: [3×1 double]
      upper: [3×1 double]

The linear inequality constraint has an associated Lagrange multiplier of 12.

Display the multipliers associated with the lower bound.

disp(lambda.lower)

    5.0000
    0.0000
    0.0000

Only the first component of lambda.lower has a nonzero multiplier. This generally means that only the first component of x is at the lower bound of zero. Confirm by displaying the components of x.

disp(x)

    0.0000
    1.5000
    1.5000

Return Warm Start Object

To speed subsequent quadprog calls, create a warm start object.

options = optimoptions('quadprog','Algorithm','active-set');
x0 = [1 2 3];
ws = optimwarmstart(x0,options);

Solve a quadratic program using ws.

H = [1,-1,1
    -1,2,-2
    1,-2,4];
f = [-7;-12;-15];
A = [1,1,1];
b = 3;
lb = zeros(3,1);
tic
[ws,fval,exitflag,output,lambda] = quadprog(H,f,A,b,[],[],lb,[],ws);

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

toc

Elapsed time is 0.060411 seconds.

Change the objective function and solve the problem again.

f = [-10;-15;-20];

tic
[ws,fval,exitflag,output,lambda] = quadprog(H,f,A,b,[],[],lb,[],ws);

Minimum found that satisfies the constraints.

Optimization completed because the objective function is non-decreasing in 
feasible directions, to within the value of the optimality tolerance,
and constraints are satisfied to within the value of the constraint tolerance.

<stopping criteria details>

toc

Elapsed time is 0.010756 seconds.

Input Arguments

H — Quadratic objective term

symmetric real matrix

Quadratic objective term, specified as a symmetric real matrix. H represents the quadratic in the expression 1/2*x'*H*x + f'*x. If H is not symmetric, quadprog issues a warning and uses the symmetrized version (H + H')/2 instead.

If the quadratic matrix H is sparse, then by default, the 'interior-point-convex' algorithm uses a slightly different algorithm than when H is dense. Generally, the sparse algorithm is faster on large, sparse problems, and the dense algorithm is faster on dense or small problems. For more information, see the LinearSolver option description and interior-point-convex quadprog Algorithm.

Example: [2,1;1,3]

Data Types: single | double

f — Linear objective term

real vector

Linear objective term, specified as a real vector. f represents the linear term in the expression 1/2*x'*H*x + f'*x.

Example: [1;3;2]

Data Types: single | double

A — Linear inequality constraints

real matrix

Linear inequality constraints, specified as a real matrix. A is an M-by-N matrix, where M is the number of inequalities, and N is the number of variables (number of elements in x0). For large problems with algorithms that support sparse data, pass A as a sparse matrix. See Sparsity in Optimization Algorithms.

A encodes the M linear inequalities

A*x <= b,

where x is the column vector of N variables x(:), and b is a column vector with M elements.

For example, consider these inequalities:

x₁ + 2x₂ ≤ 10
3x₁ + 4x₂ ≤ 20
5x₁ + 6x₂ ≤ 30,

Specify the inequalities by entering the following constraints.

A = [1,2;3,4;5,6];
b = [10;20;30];

Example: To specify that the x components sum to 1 or less, use A = ones(1,N) and b = 1.

Data Types: single | double

b — Linear inequality constraints

real vector

Linear inequality constraints, specified as a real vector. b is an M-element vector related to the A matrix. If you pass b as a row vector, solvers internally convert b to the column vector b(:).

b encodes the M linear inequalities

A*x <= b,

where x is the column vector of N variables x(:), and A is a matrix of size M-by-N.

For example, consider these inequalities:

x₁ + 2x₂ ≤ 10
3x₁ + 4x₂ ≤ 20
5x₁ + 6x₂ ≤ 30.

Specify the inequalities by entering the following constraints.

A = [1,2;3,4;5,6];
b = [10;20;30];

Example: To specify that the x components sum to 1 or less, use A = ones(1,N) and b = 1.

Data Types: single | double

Aeq — Linear equality constraints

real matrix

Linear equality constraints, specified as a real matrix. Aeq is an Me-by-N matrix, where Me is the number of equalities, and N is the number of variables (number of elements in x0). For large problems with algorithms that support sparse data, pass A as a sparse matrix. See Sparsity in Optimization Algorithms.

Aeq encodes the Me linear equalities

Aeq*x = beq,

where x is the column vector of N variables x(:), and beq is a column vector with Me elements.

For example, consider these inequalities:

x₁ + 2x₂ + 3x₃ = 10
2x₁ + 4x₂ + x₃ = 20,

Specify the inequalities by entering the following constraints.

Aeq = [1,2,3;2,4,1];
beq = [10;20];

Example: To specify that the x components sum to 1, use Aeq = ones(1,N) and beq = 1.

Data Types: single | double

beq — Linear equality constraints

real vector

Linear equality constraints, specified as a real vector. beq is an Me-element vector related to the Aeq matrix. If you pass beq as a row vector, solvers internally convert beq to the column vector beq(:).

beq encodes the Me linear equalities

Aeq*x = beq,

where x is the column vector of N variables x(:), and Aeq is a matrix of size Me-by-N.

For example, consider these equalities:

x₁ + 2x₂ + 3x₃ = 10
2x₁ + 4x₂ + x₃ = 20.

Specify the equalities by entering the following constraints.

Aeq = [1,2,3;2,4,1];
beq = [10;20];

Example: To specify that the x components sum to 1, use Aeq = ones(1,N) and beq = 1.

Data Types: single | double

lb — Lower bounds

real vector | real array

Lower bounds, specified as a real vector or real array. If the number of elements in x0 is equal to the number of elements in lb, then lb specifies that

x(i) >= lb(i) for all i.

If numel(lb) < numel(x0), then lb specifies that

x(i) >= lb(i) for 1 <= i <= numel(lb).

If lb has fewer elements than x0, solvers issue a warning.

Example: To specify that all x components are positive, use lb = zeros(size(x0)).

Data Types: single | double

ub — Upper bounds

real vector | real array

Upper bounds, specified as a real vector or real array. If the number of elements in x0 is equal to the number of elements in ub, then ub specifies that

x(i) <= ub(i) for all i.

If numel(ub) < numel(x0), then ub specifies that

x(i) <= ub(i) for 1 <= i <= numel(ub).

If ub has fewer elements than x0, solvers issue a warning.

Example: To specify that all x components are less than 1, use ub = ones(size(x0)).

Data Types: single | double

x0 — Initial point

real vector

Initial point, specified as a real vector. The length of x0 is the number of rows or columns of H.

x0 applies to the 'trust-region-reflective' algorithm when the problem has only bound constraints. x0 also applies to the 'active-set' algorithm.

Note

x0 is a required argument for the 'active-set' algorithm.

If you do not specify x0, quadprog sets all components of x0 to a point in the interior of the box defined by the bounds. quadprog ignores x0 for the 'interior-point-convex' algorithm and for the 'trust-region-reflective' algorithm with equality constraints.

Example: [1;2;1]

Data Types: single | double

options — Optimization options

output of optimoptions | structure such as optimset returns

Optimization options, specified as the output of optimoptions or a structure such as optimset returns.

Some options are absent from the optimoptions display. These options appear in italics in the following table. For details, see View Optimization Options.

All Algorithms

Algorithm	Choose the algorithm: 'interior-point-convex' (default) 'trust-region-reflective' 'active-set' The 'interior-point-convex' algorithm handles only convex problems. The 'trust-region-reflective' algorithm handles problems with only bounds or only linear equality constraints, but not both. The 'active-set' algorithm handles indefinite problems provided that the projection of H onto the nullspace of Aeq is positive semidefinite. For details, see Choosing the Algorithm.
Diagnostics	Display diagnostic information about the function to be minimized or solved. The choices are 'on' or 'off' (default).
Display	Level of display (see Iterative Display): 'off' or 'none' displays no output. 'final' displays only the final output (default). The 'interior-point-convex' and 'active-set' algorithms allow additional values: 'iter' specifies an iterative display. 'iter-detailed' specifies an iterative display with a detailed exit message. 'final-detailed' displays only the final output with a detailed exit message.
MaxIterations	Maximum number of iterations allowed; a nonnegative integer. For a 'trust-region-reflective' equality-constrained problem, the default value is 2*(numberOfVariables – numberOfEqualities). 'active-set' has a default of 10*(numberOfVariables + numberOfConstraints). For all other algorithms and problems, the default value is 200. For optimset, the option name is MaxIter. See Current and Legacy Option Names.
OptimalityTolerance	Termination tolerance on the first-order optimality; a nonnegative scalar. For a 'trust-region-reflective' equality-constrained problem, the default value is 1e-6. For a 'trust-region-reflective' bound-constrained problem, the default value is 100*eps, about 2.2204e-14. For the 'interior-point-convex' and 'active-set' algorithms, the default value is 1e-8. See Tolerances and Stopping Criteria. For optimset, the option name is TolFun. See Current and Legacy Option Names.
StepTolerance	Termination tolerance on x; a nonnegative scalar. For 'trust-region-reflective', the default value is 100*eps, about 2.2204e-14. For 'interior-point-convex', the default value is 1e-12. For 'active-set', the default value is 1e-8. For optimset, the option name is TolX. See Current and Legacy Option Names.

'trust-region-reflective' Algorithm Only

FunctionTolerance	Termination tolerance on the function value; a nonnegative scalar. The default value depends on the problem type: bound-constrained problems use 100*eps, and linear equality-constrained problems use 1e-6. See Tolerances and Stopping Criteria. For optimset, the option name is TolFun. See Current and Legacy Option Names.
HessianMultiplyFcn	Hessian multiply function, specified as a function handle. For large-scale structured problems, this function computes the Hessian matrix product H*Y without actually forming H. The function has the form W = hmfun(Hinfo,Y) where Hinfo (and potentially some additional parameters) contain the matrices used to compute H*Y. See Quadratic Minimization with Dense, Structured Hessian for an example that uses this option. For optimset, the option name is HessMult. See Current and Legacy Option Names.
MaxPCGIter	Maximum number of PCG (preconditioned conjugate gradient) iterations; a positive scalar. The default is max(1,floor(numberOfVariables/2)) for bound-constrained problems. For equality-constrained problems, quadprog ignores MaxPCGIter and uses MaxIterations to limit the number of PCG iterations. For more information, see Preconditioned Conjugate Gradient Method.
PrecondBandWidth	Upper bandwidth of the preconditioner for PCG; a nonnegative integer. By default, quadprog uses diagonal preconditioning (upper bandwidth 0). For some problems, increasing the bandwidth reduces the number of PCG iterations. Setting PrecondBandWidth to Inf uses a direct factorization (Cholesky) rather than the conjugate gradients (CG). The direct factorization is computationally more expensive than CG, but produces a better quality step toward the solution.
SubproblemAlgorithm	Determines how the iteration step is calculated. The default, 'cg', takes a faster but less accurate step than 'factorization'. See trust-region-reflective quadprog Algorithm.
TolPCG	Termination tolerance on the PCG iteration; a positive scalar. The default is 0.1.
TypicalX	Typical x values. The number of elements in TypicalX equals the number of elements in x0, the starting point. The default value is ones(numberOfVariables,1). quadprog uses TypicalX internally for scaling. TypicalX has an effect only when x has unbounded components, and when a TypicalX value for an unbounded component exceeds 1.

'interior-point-convex' Algorithm Only

ConstraintTolerance	Tolerance on the constraint violation; a nonnegative scalar. The default is 1e-8. For optimset, the option name is TolCon. See Current and Legacy Option Names.
LinearSolver	Type of internal linear solver in the algorithm: 'auto' (default) — Use 'sparse' if the H matrix is sparse and 'dense' otherwise. 'sparse' — Use sparse linear algebra. See Sparse Matrices. 'dense' — Use dense linear algebra.
ScaleProblem	When true, perform internal scaling to improve problem conditioning and possibly obtain a faster or more accurate solution. The default is false. On some problems with poorly-scaled linear constraint (A or Aeq) or quadratic objective coefficient (H) matrices, the true setting can provide a noticeable speedup or improved solution accuracy. However, ScaleProblem=true can add a small time overhead to the solver, and in some cases can cause poor convergence.

'active-set' Algorithm Only

ConstraintTolerance	Tolerance on the constraint violation; a nonnegative scalar. The default value is 1e-8. For optimset, the option name is TolCon. See Current and Legacy Option Names.
ObjectiveLimit	A tolerance (stopping criterion) that is a scalar. If the objective function value goes below ObjectiveLimit and the current point is feasible, the iterations halt because the problem is unbounded, presumably. The default value is -1e20.
UseCodegenSolver	Indication to use the version of the software that runs on target hardware, specified as true or the default false. Use this option for testing code in the desktop environment prior to generating code. You can pass this option when generating code, but it has no effect on code generation.

Single-Precision Code Generation

Algorithm	Must be 'active-set'.
ConstraintTolerance	Tolerance on the constraint violation, a positive scalar. The default value is 1e-4. For optimset, the option name is TolCon. See Current and Legacy Option Names.
MaxIterations	Maximum number of iterations allowed, a nonnegative integer. The default value is 10*(nVar + mConstr), where nVar is the number of problem variables and mConstr is the number of constraints.
ObjectiveLimit	A tolerance (stopping criterion) that is a scalar. If the objective function value goes below ObjectiveLimit and the current point is feasible, the iterations halt because the problem is unbounded, presumably. The default value is -1e20.
OptimalityTolerance	Termination tolerance on the first-order optimality, a positive scalar. The default value is 1e-4. See First-Order Optimality Measure. For optimset, the name is TolFun. See Current and Legacy Option Names.
StepTolerance	Termination tolerance on x, a positive scalar. The default value is 1e-4. For optimset, the option name is TolX. See Current and Legacy Option Names.
UseCodegenSolver	Indication to use the version of the software that runs on target hardware, specified as true or the default false. Use this option for testing code in the desktop environment prior to generating code. You can pass this option when generating code, but it has no effect on code generation.

problem — Problem structure

structure

Problem structure, specified as a structure with these fields:

H	Symmetric matrix in 1/2*x'*H*x
f	Vector in linear term f'*x
Aineq	Matrix in linear inequality constraints Aineq*x ≤ bineq
bineq	Vector in linear inequality constraints Aineq*x ≤ bineq
Aeq	Matrix in linear equality constraints Aeq*x = beq
beq	Vector in linear equality constraints Aeq*x = beq
lb	Vector of lower bounds
ub	Vector of upper bounds
x0	Initial point for x
solver	'quadprog'
options	Options created using optimoptions or optimset

The required fields are H, f, solver, and options. When solving, quadprog ignores any fields in problem other than those listed.

Note

You cannot use warm start with the problem argument.

Data Types: struct

ws — Warm start object

object created using optimwarmstart

Warm start object, specified as an object created using optimwarmstart. The warm start object contains the start point and options, and optional data for memory size in code generation. See Warm Start Best Practices.

Example: ws = optimwarmstart(x0,options)

Output Arguments

x — Solution

real vector

Solution, returned as a real vector. x is the vector that minimizes 1/2*x'*H*x + f'*x subject to all bounds and linear constraints. x can be a local minimum for nonconvex problems. For convex problems, x is a global minimum. For more information, see Local vs. Global Optima.

wsout — Solution warm start object

QuadprogWarmStart object

Solution warm start object, returned as a QuadprogWarmStart object. The solution point is wsout.X.

You can use wsout as the input warm start object in a subsequent quadprog call.

fval — Objective function value at solution

real scalar

Objective function value at the solution, returned as a real scalar. fval is the value of 1/2*x'*H*x + f'*x at the solution x.

exitflag — Reason quadprog stopped

integer

Reason quadprog stopped, returned as an integer described in this table.

All Algorithms
1	Function converged to the solution x.
0	Number of iterations exceeded options.MaxIterations.
-2	Problem is infeasible. Or, for 'interior-point-convex', the step size was smaller than options.StepTolerance, but constraints were not satisfied.
-3	Problem is unbounded.
'interior-point-convex' Algorithm
2	Step size was smaller than options.StepTolerance, constraints were satisfied.
-6	Nonconvex problem detected.
-8	Unable to compute a step direction.
'trust-region-reflective' Algorithm
4	Local minimum found; minimum is not unique.
3	Change in the objective function value was smaller than options.FunctionTolerance.
-4	Current search direction was not a direction of descent. No further progress could be made.
'active-set' Algorithm
-6	Nonconvex problem detected; projection of H onto the nullspace of Aeq is not positive semidefinite.

Note

Occasionally, the 'active-set' algorithm halts with exit flag 0 when the problem is, in fact, unbounded. Setting a higher iteration limit also results in exit flag 0.

output — Information about optimization process

structure

Information about the optimization process, returned as a structure with these fields:

iterations	Number of iterations taken
algorithm	Optimization algorithm used
cgiterations	Total number of PCG iterations ('trust-region-reflective' algorithm only)
constrviolation	Maximum of constraint functions
firstorderopt	Measure of first-order optimality
linearsolver	Type of internal linear solver, 'dense' or 'sparse' ('interior-point-convex' algorithm only)
message	Exit message

lambda — Lagrange multipliers at solution

structure

Lagrange multipliers at the solution, returned as a structure with these fields:

lower	Lower bounds lb
upper	Upper bounds ub
ineqlin	Linear inequalities
eqlin	Linear equalities

For details, see Lagrange Multiplier Structures.

More About

Enhanced Exit Messages

The next few items list the possible enhanced exit messages from quadprog. Enhanced exit messages give a link for more information as the first sentence of the message.

Minimum Found That Satisfies The Constraints

The solver found a minimizing point that satisfies all bounds and linear constraints. Since the problem is convex, the minimizing point is a global minimum. For more information, see Local vs. Global Optima.

Solver Stalled, Constraints Satisfied

The solver stopped because the last step was too small. When the relative step size goes below the StepTolerance tolerance, then the iterations end. Sometimes, this means that the solver located the minimum. However, the first-order optimality measure was not less than the OptimalityTolerance, so it is possible that the result is inaccurate. All constraints were satisfied.

To proceed, try the following:

• Examine the first-order optimality measure in the output structure. If the first-order optimality measure is small, then it is likely that the returned solution is accurate.

• Set the StepTolerance option to 0. Sometimes, this setting helps the solver proceed, though sometimes the solver remains stalled because of other issues.

• Try a different algorithm. If the solver offers a choice of algorithms, sometimes a different algorithm can succeed.

• Try removing dependent constraints. This means ensure that none of the linear constraints are redundant.

Problem Appears Unbounded

quadprog stopped because it appears to have found a direction that satisfies all constraints and causes the objective to decrease without bound.

To proceed,

• Ensure that you have finite bound for each component.

• Check the objective function to ensure that it is strictly convex (the quadratic matrix has strictly positive eigenvalues).

• See if the associated linear programming problem (the original problem without the quadratic term) has a finite solution.

Unable to Compute a Step Direction

The solver was unable to proceed because it could not compute a direction leading to a minimum. It is likely that this trouble is due to redundant linear constraints or tolerances that are too small.

To proceed,

• Check your linear constraint matrices for redundancy. Try to identify and remove redundant linear constraints.

• Ensure that your FunctionTolerance, OptimalityTolerance, and ConstraintTolerance options are above 1e-14, and are preferably above 1e-12. See Tolerances and Stopping Criteria.

The Problem Is Non-Convex

quadprog determined that the problem is not Convex. Try a different algorithm. For more information, see Quadratic Programming Algorithms.

Solution Found During Presolve

The solver found the solution during the presolve phase. This means the bounds, linear constraints, and f (linear objective coefficient) immediately lead to a solution. For more information, see Presolve/Postsolve.

The Problem Is Infeasible

During presolve, the solver found that the problem has an inconsistent formulation. Inconsistent means not all constraints can be satisfied at a single point x. For more information, see Presolve/Postsolve.

The Problem Is Unbounded

During presolve, the solver found a feasible direction where the objective function decreases without bound. For more information, see Presolve/Postsolve.

Converged to an Infeasible Point

quadprog converged to a point that does not satisfy all constraints to within the constraint tolerance called ConstraintTolerance. The reason quadprog stopped is that the last step was too small. When the relative step size goes below the StepTolerance tolerance, then the iterations end.

For suggestions on how to proceed, see quadprog Converges to an Infeasible Point.

No feasible solution found

The solver converged to a point that does not satisfy all constraints to within the constraint tolerance called ConstraintTolerance. The reason the solver stopped is that the last step was too small. When the relative step size goes below the StepTolerance tolerance, then the iterations end.

No feasible solution found

There is no point satisfying all of the bounds and linear constraints. For help examining the inconsistent linear constraints, see Investigate Linear Infeasibilities.

Optimal Solution Found

There is only one feasible point. The number of independent linear equality constraints is the same as the number of variables in the problem.

Optimal Solution Found

The solver stopped because the first-order optimality measure is less than the OptimalityTolerance tolerance.

The first-order optimality measure is the infinity norm of the projected gradient. The projection is onto the null space of the linear equality matrix Aeq.

Local Minimum Found

The solver stopped at a point of zero curvature that is a local minimum. There are other feasible points that have the same objective function value.

The Problem Is Unbounded

There are directions of zero or negative curvature along which the objective function decreases indefinitely. Therefore, for any target value, there are feasible points with objective value smaller than the target. Check whether you included enough constraints in the problem, such as bounds on all variables.

Optimal Solution Found

The solver stopped because the first-order optimality measure is less than the OptimalityTolerance tolerance.

Local Minimum Possible

The solver stopped because the relative change in function value was below the FunctionTolerance tolerance. To check solution quality, see Local Minimum Possible.

Local Minimum Possible

The solver stopped because the relative change in function value was below the square root of the FunctionTolerance tolerance, and the change of function values in the previous iterations is decreasing by less than a factor of 3.5. This criterion stops the solver when the difference of objective function values is relatively small, but does not decrease to zero quickly enough. To check solution quality, see Local Minimum Possible.

Definitions for Exit Messages

The next few items contain definitions for terms in the quadprog exit messages.

tolerance

Generally, a tolerance is a threshold which, if crossed, stops the iterations of a solver. For more information on tolerances, see Tolerances and Stopping Criteria.

Convex

A quadratic program is convex if, from any feasible point, there is no feasible direction with negative curvature. A convex problem has only one local minimum, which is also the global minimum.

Feasible Directions

The feasible directions from a feasible point x are those vectors v such that for small enough positive a, x + av is feasible.

A feasible point is one satisfying all the constraints.

StepTolerance

StepTolerance is a tolerance for the size of the last step, meaning the size of the change in location where fsolve was evaluated.

OptimalityTolerance

The tolerance called OptimalityTolerance relates to the first-order optimality measure. Iterations end when the first-order optimality measure is less than OptimalityTolerance.

For constrained problems, the first-order optimality measure is the maximum of the following two quantities:

$$\begin{array}{l}\Vert {\nabla }_{x}L(x,\lambda \Vert =\Vert \nabla f(x)+A^T{\lambda }_{ineqlin}+Ae{q}^T{\lambda }_{eqlin}\\ +{\displaystyle \sum {\lambda }_{ineqnonlin,i}\nabla c_i(x)+{\displaystyle \sum {\lambda }_{eqnonlin,i}\nabla ce{q}_i(x)}}\Vert ,\end{array}$$

$$\Vert \overrightarrow{\left|l_i-x_i\right|{\lambda }_{lower,i}},\overrightarrow{\left|x_i-u_i\right|{\lambda }_{upper,i}},\overrightarrow{\left|{(Ax-b)}_i\right|{\lambda }_{ineqlin,i}},\overrightarrow{\left|c_i(x)\right|{\lambda }_{ineqnonlin,i}}\Vert .$$

For unconstrained problems, the first-order optimality measure is the maximum of the absolute value of the components of the gradient vector (also known as the infinity norm).

The first-order optimality measure should be zero at a minimizing point.

For more information, including definitions of all the variables in these equations, see First-Order Optimality Measure.

first-order optimality measure for problems with bounds

For unconstrained problems, the first-order optimality measure is the maximum of the absolute value of the components of the gradient vector (also known as the infinity norm of the gradient). This should be zero at a minimizing point.

For problems with bounds, the first-order optimality measure is the maximum over i of |v_i*g_i|. Here g_i is the ith component of the gradient, x is the current point, and

$$v_i=\{\begin{array}{ll}\left|x_i-b_i\right|\hfill & \text{if the negative gradient points toward bound }{b}_i\hfill \\ 1\hfill & \text{otherwise}\text{.}\hfill \end{array}$$

If x_i is at a bound, v_i is zero. If x_i is not at a bound, then at a minimizing point the gradient g_i should be zero. Therefore the first-order optimality measure should be zero at a minimizing point.

For more information, see First-Order Optimality Measure.

ConstraintTolerance

The constraint tolerance called ConstraintTolerance is the maximum of the values of all constraint functions at the current point.

ConstraintTolerance operates differently from other tolerances. If ConstraintTolerance is not satisfied (i.e., if the magnitude of the constraint function exceeds ConstraintTolerance), the solver attempts to continue, unless it is halted for another reason. A solver does not halt simply because ConstraintTolerance is satisfied.

Relative Dual Feasibility

The dual feasibility r_d is defined in terms of the KKT conditions for the problem. The relative dual feasibility stopping condition is

rd ≤ ρOptimalityTolerance,

(1)

where ρ is a scale factor.

For more information, see Predictor-Corrector.

Dual Feasibility

The KKT conditions state that at an optimum x, there are Lagrange multipliers $${\overline{\lambda }}_{\text{ineq}}$$ and λ_eq such that

$$\begin{array}{c}Hx+c+A_{\text{eq}}^T{\lambda }_{\text{eq}}+{\overline{A}}^T{\overline{\lambda }}_{\text{ineq}}=0\\ \overline{A}x-\overline{b}+s=0\\ A_{\text{eq}}x-b_{\text{eq}}=0\\ s_i{\overline{\lambda }}_{\text{ineq},i}=0\\ s_i\ge 0\\ {\overline{\lambda }}_{\text{ineq},i}\ge 0.\end{array}$$

The variables $$\overline{A}$$, $${\overline{\lambda }}_{\text{ineq}}$$, and $$\overline{b}$$ include bounds as part of the linear inequalities.

The dual feasibility r_d is the absolute value of $$r_{\text{d}}=Hx+c+A_{\text{eq}}^T{\lambda }_{\text{eq}}+{\overline{A}}^T{\overline{\lambda }}_{\text{ineq}}$$.

Scale Factor

The scale factor ρ is

$$\rho =\max \left(1,\Vert H\Vert ,\Vert \overline{A}\Vert ,\Vert A_{eq}\Vert ,\Vert c\Vert ,\Vert \overline{b}\Vert ,\Vert b_{eq}\Vert \right).$$

The norm $$\Vert \cdot \Vert$$ is the maximum absolute value of the elements in the expression.

Complementarity Measure

The complementarity measure is defined in terms of the KKT conditions for the problem. At an optimum x, there are Lagrange multipliers $${\overline{\lambda }}_{\text{ineq}}$$ and λ_eq such that

$$\begin{array}{c}Hx+c+A_{\text{eq}}^T{\lambda }_{\text{eq}}+{\overline{A}}^T{\overline{\lambda }}_{\text{ineq}}=0\\ \overline{A}x-\overline{b}+s=0\\ A_{\text{eq}}x-b_{\text{eq}}=0\\ s_i{\overline{\lambda }}_{\text{ineq},i}=0\\ s_i\ge 0\\ {\overline{\lambda }}_{\text{ineq},i}\ge 0.\end{array}$$

The variables $$\overline{A}$$, $${\overline{\lambda }}_{\text{ineq}}$$, and $$\overline{b}$$ include bounds as part of the linear inequalities.

The complementarity measure is :

$${\displaystyle \sum _i{s}_i{\overline{\lambda }}_{\text{ineq},i}}.$$

For more information, see Predictor-Corrector.

Total Relative Error

The total relative error is defined in terms of the KKT conditions for the problem. The total relative error stopping condition holds when the Merit Function φ satisfies

φ ≥ max(OptimalityTolerance,105φmin).

(2)

When this stopping condition holds, the solver determines that the quadratic program is infeasible.

Merit Function

The KKT conditions state that at an optimum x, there are Lagrange multipliers $${\overline{\lambda }}_{\text{ineq}}$$ and λ_eq such that

$$\begin{array}{c}Hx+c+A_{\text{eq}}^T{\lambda }_{\text{eq}}+{\overline{A}}^T{\overline{\lambda }}_{\text{ineq}}=0\\ \overline{A}x-\overline{b}+s=0\\ A_{\text{eq}}x-b_{\text{eq}}=0\\ s_i{\overline{\lambda }}_{\text{ineq},i}=0\\ s_i\ge 0\\ {\overline{\lambda }}_{\text{ineq},i}\ge 0.\end{array}$$

The variables $$\overline{A}$$, $${\overline{\lambda }}_{\text{ineq}}$$, and $$\overline{b}$$ include bounds as part of the linear inequalities.

The merit function φ is

$$\frac{1}{\rho }\left(\max \left({\Vert r_{\text{eq}}\Vert }_{\infty },{\Vert r_{\text{ineq}}\Vert }_{\infty },{\Vert r_{\text{d}}\Vert }_{\infty }\right)+g\right).$$

The terms in the definition of φ are:

$$\begin{array}{c}\rho =\max \left(1,\Vert H\Vert ,\Vert \overline{A}\Vert ,\Vert A_{eq}\Vert ,\Vert c\Vert ,\Vert \overline{b}\Vert ,\Vert b_{eq}\Vert \right)\\ r_{\text{eq}}=A_{\text{eq}}x-b_{\text{eq}}\\ r_{\text{ineq}}=\overline{A}x-\overline{b}+s\\ r_{\text{d}}=Hx+c+A_{\text{eq}}^T{\lambda }_{\text{eq}}+{\overline{A}}^T{\overline{\lambda }}_{\text{ineq}}\\ g=x^{T}Hx+f^{T}x-\overline{b}{\overline{\lambda }}_{\text{ineq}}-b_{\text{eq}}{\lambda }_{\text{eq}}.\end{array}$$

The expression φ_min means the minimum of φ seen in all iterations.

Presolve

Presolve is a set of algorithms that simplify a linear or quadratic programming problem. The algorithms look for simple inconsistencies such as inconsistent bounds and linear constraints. They also look for redundant bounds and linear inequalities. For more information, see Presolve/Postsolve.

The Problem Appears to Be Ill-Conditioned

The internally-calculated search direction does not decrease the objective function value. Perhaps the problem is poorly scaled or has an ill-conditioned matrix (H for quadprog, C for lsqlin). For suggestions on how to proceed, see When the Solver Fails or Local Minimum Possible.

Algorithms

'interior-point-convex'

The 'interior-point-convex' algorithm attempts to follow a path that is strictly inside the constraints. It uses a presolve module to remove redundancies and to simplify the problem by solving for components that are straightforward.

The algorithm has different implementations for a sparse Hessian matrix H and for a dense matrix. Generally, the sparse implementation is faster on large, sparse problems, and the dense implementation is faster on dense or small problems. For more information, see interior-point-convex quadprog Algorithm.

'trust-region-reflective'

The 'trust-region-reflective' algorithm is a subspace trust-region method based on the interior-reflective Newton method described in [1]. Each iteration involves the approximate solution of a large linear system using the method of preconditioned conjugate gradients (PCG). For more information, see trust-region-reflective quadprog Algorithm.

'active-set'

The 'active-set' algorithm is a projection method, similar to the one described in [2]. The algorithm does not use sparse data; see Sparsity in Optimization Algorithms. For more information, see active-set quadprog Algorithm.

Warm Start

A warm start object maintains a list of active constraints from the previous solved problem. The solver carries over as much active constraint information as possible to solve the current problem. If the previous problem is too different from the current one, no active set information is reused. In this case, the solver effectively executes a cold start in order to rebuild the list of active constraints.

Alternative Functionality

App

The Optimize Live Editor task provides a visual interface for quadprog.

References

[1] Coleman, T. F., and Y. Li. “A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables.” SIAM Journal on Optimization. Vol. 6, Number 4, 1996, pp. 1040–1058.

[2] Gill, P. E., W. Murray, and M. H. Wright. Practical Optimization. London: Academic Press, 1981.

[3] Gould, N., and P. L. Toint. “Preprocessing for quadratic programming.” Mathematical Programming. Series B, Vol. 100, 2004, pp. 95–132.

Extended Capabilities

C/C++ Code Generation

Generate C and C++ code using MATLAB® Coder™.

Usage notes and limitations:

• quadprog supports code generation using either the codegen (MATLAB Coder) function or the MATLAB^® Coder™ app. You must have a MATLAB Coder license to generate code.

• The target hardware must support standard double-precision floating-point computations or standard single-precision floating-point computations.

• Code generation targets do not use the same math kernel libraries as MATLAB solvers. Therefore, code generation solutions can vary from solver solutions, especially for poorly conditioned problems.

• To test your code in MATLAB before generating code, set the UseCodegenSolver option to true. That way, the solver uses the same code that code generation creates.

• quadprog does not support the problem argument for code generation.

  [x,fval] = quadprog(problem) % Not supported

• All quadprog input matrices such as A, Aeq, lb, and ub must be full, not sparse. You can convert sparse matrices to full by using the full function.

• The lb and ub arguments must have the same number of entries as the number of columns in H or must be empty [].

• If your target hardware does not support infinite bounds, use optim.coder.infbound.

• For advanced code optimization involving embedded processors, you also need an Embedded Coder^® license.

• You must include options for quadprog and specify them using optimoptions. The options must include the Algorithm option, set to 'active-set'.

  options = optimoptions("quadprog",Algorithm="active-set");
  [x,fval,exitflag] = quadprog(H,f,A,b,Aeq,beq,lb,ub,x0,options);

• Code generation supports these options:

  • Algorithm — Must be 'active-set'

  • ConstraintTolerance

  • MaxIterations

  • ObjectiveLimit

  • OptimalityTolerance

  • StepTolerance

  • UseCodegenSolver

• Generated code has limited error checking for options. The recommended way to update an option is to use optimoptions, not dot notation.

  opts = optimoptions('quadprog','Algorithm','active-set');
  opts = optimoptions(opts,'MaxIterations',1e4); % Recommended
  opts.MaxIterations = 1e4; % Not recommended

• Do not load options from a file. Doing so can cause code generation to fail. Instead, create options in your code.

• If you specify an option that is not supported, the option is typically ignored during code generation. For reliable results, specify only supported options.

For an example, see Generate Code for quadprog.

Version History

Introduced before R2006a

R2025a: Test Before Generating Code

Set the new UseCodegenSolver option to true to have quadprog use the same version of the software that code generation creates. This option allows you to check the behavior of the solver before you generate code or deploy the code to hardware. For solvers that support single-precision code generation, the generated code can also support single-precision hardware. You can include the option when you generate code; the option has no effect in code generation, but leaving the option in saves you the step of removing it. Even though the generated code is identical to the MATLAB code, results can differ slightly because linked math libraries can differ.

R2025a: ScaleProblem Option for quadprog

The "interior-point-convex" algorithm of the quadprog solver gains the ScaleProblem option, which can speed the solution of some poorly-scaled problems. For details, see the quadprog options argument description.

R2024b: Generate single-precision code

You can generate code using quadprog for single-precision floating point hardware. For instructions, see Single-Precision Code Generation.