Re: Behaviour of FMINCON - question.



Thank you Pluton for your reply and the text you copied from the
MATLAB doc/help files.

I still cannot get to the bottom of my problem. Regarding the
updating of the Hessian, I have found:

"Sometimes the message "no update" is displayed (*as output*),
indicating that ((q_k)^T)(s_k) is nearly zero. This can be an
indication that the problem setup is wrong or you are trying to
minimize a noncontinuous function."

As far as I can see and understand, my problem is set up correctly
and my funcion is continuous.

Trying to get to the root of my problem is proving quite difficult
for me. Has nobody else experienced similar problems before?

Regards,
Barry

pluton wrote:


Maybe you can try to get some of the references mentionned above.

Matlab Help browser :

Algorithm

Large-Scale Optimization

The large-scale algorithm is a subspace trust region method and is
based on the interior-reflective Newton method described in [1],
[2].
Each iteration involves the approximate solution of a large linear
system using the method of preconditioned conjugate gradients
(PCG).
See the trust region and preconditioned conjugate gradient method
descriptions in the Large-Scale Algorithms chapter.
Medium-Scale Optimization


fmincon uses a sequential quadratic programming (SQP) method. In
this
method, the function solves a quadratic programming (QP) subproblem
at
each iteration. An estimate of the Hessian of the Lagrangian is
updated
at each iteration using the BFGS formula (see fminunc, references
[7],
[8]).

A line search is performed using a merit function similar to that
proposed by [4], [5], and [6]. The QP subproblem is solved using an
active set strategy similar to that described in [3]. A full
description of this algorithm is found in Constrained Optimization
in
Standard Algorithms.

See also SQP Implementation in Standard Algorithms for more details
on
the algorithm used.
Limitations


fmincon only handles real variables.

The function to be minimized and the constraints must both be
continuous. fmincon might only give local solutions.

When the problem is infeasible, fmincon attempts to minimize the
maximum constraint value.

The objective function and constraint function must be real-valued;
that is, they cannot return complex values.

The large-scale method does not allow equal upper and lower bounds.
For
example if lb(2)==ub(2), then fmincon gives the error
Equal upper and lower bounds not permitted in this large-scale
method.
Use equality constraints and the medium-scale method instead.



If you only have equality constraints you can still use the
large-scale
method. But if you have both equalities and bounds, you must use
the
medium-scale method.
See Also


@ (function_handle), fminbnd, fminsearch, fminunc, optimset
References


[1] Coleman, T.F. and Y. Li, "An Interior, Trust Region Approach
for
Nonlinear Minimization Subject to Bounds," SIAM Journal on
Optimization, Vol. 6, pp. 418-445, 1996.

[2] Coleman, T.F. and Y. Li, "On the Convergence of Reflective
Newton
Methods for Large-Scale Nonlinear Minimization Subject to Bounds,"
Mathematical Programming, Vol. 67, Number 2, pp. 189-224, 1994.

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

[4] Han, S.P., "A Globally Convergent Method for Nonlinear
Programming," Vol. 22, Journal of Optimization Theory and
Applications,
p. 297, 1977.

[5] Powell, M.J.D., "A Fast Algorithm for Nonlinearly Constrained
Optimization Calculations," Numerical Analysis, ed. G.A. Watson,
Lecture Notes in Mathematics, Springer Verlag, Vol. 630, 1978.

[6] Powell, M.J.D., "The Convergence of Variable Metric Methods For
Nonlinearly Constrained Optimization Calculations," Nonlinear
Programming 3 (O.L. Mangasarian, R.R. Meyer, and S.M. Robinson,
eds.),
Academic Press, 1978.


.



Relevant Pages

  • Re: Behaviour of FMINCON - question.
    ... The large-scale algorithm is a subspace trust region method and is ... Medium-Scale Optimization ... Use equality constraints and the medium-scale method instead. ...
    (comp.soft-sys.matlab)
  • Re: Non-linear least squares using piece-wise approximation....
    ... "x" by a piecewise linear approximation, ... and if "x" is the value of the optimization variable where the k-th ... Additionally there are mutual exclusivity constraints e.g. x_0 and x_7 ... constrained, nonlinear least-squares solver, but I'm not clear as to ...
    (sci.math.num-analysis)
  • Re: Free Nonlinear Optimization Package?
    ... >nonlinear and there is no functional constraint. ... >a box, i.e., the optimization variables satisfy the constraints ... and box shaped feasible region". ... feasible region is the same as imposing constraints, though, I suppose ...
    (sci.math.num-analysis)
  • genetic algorithm:problem with nonlinear constraints....
    ... Hi i just started kearning matlab..I tried to perform an optimization using GA but i have some problem with nonlinear constraints.. ... My objective function is ...
    (comp.soft-sys.matlab)
  • Re: Step Control for Gradient Descent ?
    ... I have a constrained global optimization problem to solve. ... constraints are sometimes based on equality, e.g., a = f. ... starting each local search near the estimated bottom of that canyon. ...
    (sci.math)