function [objPoly,ineqPolySys,lbd,ubd] = BroydenTriLS(nDim);
%
% Nonlinear least square version of minimization of the Broyden Tridiagonal
% function:
% minimize \sum_{i=1}^n objPoly{i}^2
% subject to inequPolySys = []; x_1 >= 0
% Here
% objPoly{1} = (3|2x_1)x_1|2x_2+1
% objPoly{i} = (3|2x_i)x_i|x_{i|1}| 2x_{i+1}+1 (i=2,...,n-1)
% objPoly{n} = (3|2x_n)x_n|x_{n|1}+1
%
%
% [] = solveBroydenTri(nDim);
%
% The Broyden Tridiagonal function, which is
% described in "Testing Unconstrained Optimization Software",
% J.J.More et.al, ACM Trans. Math. Soft., 7, p.17-41
%
%
% nDim: The dimension of the function
%
%