TOMLAB OPTIMIZATION ENVIRONMENT: conAssign

conAssign

Purpose

For setting up unconstrained and constrained nonlinear programming problems.

Syntax

   Prob = conAssign(f, g, H, HessPattern, x_L, x_U, Name, x_0, ...
                    pSepFunc, fLowBnd, ...
                    A, b_L, b_U, c, dc, d2c, ConsPattern, c_L, c_U, ... 
                    x_min, x_max, f_opt, x_opt);

Description

conAssign implements the TOMLAB Quick (TQ) format for unconstrained and constrained nonlinear programming problems.

conAssign is setting the variables normally needed for an optimization in the TOMLAB structure Prob.

Input Parameters

Call with at least seven parameters

 f           Name of the function that computes the function value f(x) 
 g           Name of the function that computes the n x 1 gradient vector
 H           Name of the function that computes the n x n Hessian matrix
 HessPattern n x n zero-one sparse or dense matrix, where 0 values indicate 
             zeros in the Hessian and ones indicate values that might 
             be non-zero. If empty indicates estimation of all elements 
             HessPattern is used when estimating the Hessian numerically.
 x_L         Lower bounds on parameters x. If [] set as a nx1 -Inf vector.
 x_U         Upper bounds on parameters x. If [] set as a nx1  Inf vector.
 Name        The name of the problem (string)
 x_0         Starting values, default nx1 zero vector 

 Note:       The number n of the unknown variables x are taken as
             max(length(x_L),length(x_U),length(x_0))
             You must specifiy at least one of these with correct length,
             then the others are given default values

             The following parameters are optional, and problem type dependent
             Set empty to get default value

 pSepFunc    Number of subfunctions defined, if the function f is a partially
             separable function. 
             The function f (and g and H) must check on Prob.PartSep.index 
             if Prob.PartSep.index == 0, compute the full function 
             if Prob.PartSep.index == i > 0, compute the i:th subfunction 
             This feature is only implemented in the solver sTrustr.

 fLowBnd     A lower bound on the function value at optimum. Default 0
             A good estimate is not critical. Use [] if not known at all.

Linear constraints

 A           mA x n matrix A, linear constraints b_L<=A*x<=b_U. Dense or sparse
 b_L         Lower bound vector in linear constraints b_L <= A*x <= b_U. 
 b_U         Upper bound vector in linear constraints b_L <= A*x <= b_U. 

Nonlinear constraints

 c           Name of function that computes the mN nonlinear constraints 
 dc          Name of function that computes the constraint Jacobian mN x n 
 d2c         Name of function that computes the second part of the
             Lagrangian function (only needed for some solvers)

 ConsPattern mN x n zero-one sparse or dense matrix, where 0 values indicate 
             zeros in the constraint Jacobian and ones indicate values that 
             might be non-zero. Used when estimating the Jacobian numerically.

 c_L         Lower bound vector in nonlinear constraints b_L <= c(x) <= b_U. 
 c_U         Upper bound vector in nonlinear constraints b_L <= c(x) <= b_U. 

Additional parameters

 x_min   Lower bounds on each x-variable, used for plotting
 x_max   Upper bounds on each x-variable, used for plotting
 f_opt   Optimal function value(s), if known (Stationary points)
 x_opt   The x-values corresponding to the given f_opt, if known.
         If only one f_opt, give x_opt as a 1 by n vector
         If several f_opt values, give x_opt as a length(f_opt) by n matrix
        If adding one extra column n+1 in x_opt, 0 is min, 1 saddle, 2 is max.
         x_opt and f_opt is used in printouts and plots.

Set the variable as empty if this variable is not needed for the particular kind of problem you are solving.

clsAssign

glcAssign