ClsSolve - Revision history

Elias at 12:08, 10 January 2012

2012-01-10T12:08:45Z

← Older revision		Revision as of 07:08, 10 January 2012
Line 18:		Line 18:
	==Calling Syntax==		==Calling Syntax==

	<~~syntaxhighlight~~ lang="matlab">		<source lang="matlab">
	Result = clsSolve(Prob, varargin)		Result = clsSolve(Prob, varargin)
	Result = tomRun('clsSolve', Prob);		Result = tomRun('clsSolve', Prob);
	</~~syntaxhighlight~~>		</source>

	==Inputs==		==Inputs==

2012-01-10T11:57:39Z

← Older revision		Revision as of 06:57, 10 January 2012
Line 14:		Line 14:
	</math>		</math>

	where <math>$x,x_{L},x_{U}\in \~~MATHSET~~{R} ^{n}$</math>, <math>$r(x)\in \~~MATHSET~~{R} ^{N}$</math>, <math>$A\in \~~MATHSET~~{R}^{m_{1}\times n}$</math> and <math>$b_{L},b_{U}\in \~~MATHSET~~{R}^{m_{1}}$</math>.		where <math>x,x_{L},x_{U} \in \mathbb{R}^{n}</math>, <math>r(x) \in \mathbb{R}^{N}</math>, <math>A\in \mathbb{R}^{m_{1}\times n}</math> and <math>b_{L}, b_{U}\in \mathbb{R}^{m_{1}}</math>.

	==Calling Syntax==		==Calling Syntax==
Line 203:		Line 203:
	==See Also==		==See Also==

	~~[[TOMLAB Solver~~ conSolve~~\|''conSolve'']]~~, ~~[[TOMLAB Solver~~ nlpSolve~~\|''nlpSolve'']]~~, ~~[[TOMLAB Solver sTrustr\|''~~sTrustr~~'']]~~		conSolve, nlpSolve, sTrustr

	==Limitations==		==Limitations==

2011-07-20T14:03:54Z

Inputs

← Older revision		Revision as of 09:03, 20 July 2011
Line 26:		Line 26:

	{\| class="wikitable"		{\| class="wikitable"
	!Prob''		!''Prob''
	!colspan="2" \| Problem description structure. The following fields are used:		!colspan="2" \| Problem description structure. The following fields are used:
	\|-valign="top"		\|-valign="top"

2011-07-17T18:10:30Z

2011-07-17T18:09:38Z

2011-07-17T18:04:57Z

Description of Inputs

← Older revision		Revision as of 13:04, 17 July 2011
Line 37:		Line 37:
	2: Al-Baali - Fletcher hybrid method; Gauss-Newton/BFGS.		2: Al-Baali - Fletcher hybrid method; Gauss-Newton/BFGS.

	3: Huschens method~~. SIAM J. Optimization. Vol 4, No 1, pp 108-129 jan 1994~~.		3: Huschens method.

	4: The Gauss-Newton method.		4: The Gauss-Newton method.

2011-07-17T18:02:17Z

Description of Inputs

← Older revision		Revision as of 13:02, 17 July 2011
Line 83:		Line 83:
	\|\|\|''PriLevOpt''\|\|Print Level.		\|\|\|''PriLevOpt''\|\|Print Level.
	\|- valign="top"		\|- valign="top"
	\|\|\|\|''optParam''\|\|Structure with special fields for optimization parameters, see ~~Table 141~~. Fields used are: ''bTol'', ''eps absf'', ''eps g'', ''eps Rank'', ''eps x'', ''IterPrint'', ''MaxIter'', ''PreSolve'', ''size f'', ''size x'', ''xTol'', ''wait'', and		\|\|\|\|''optParam''\|\|Structure with special fields for optimization parameters, see [[TOMLAB Appendix A]]. Fields used are: ''bTol'', ''eps absf'', ''eps g'', ''eps Rank'', ''eps x'', ''IterPrint'', ''MaxIter'', ''PreSolve'', ''size f'', ''size x'', ''xTol'', ''wait'', and
	''QN InitMatrix ''(Initial Quasi-Newton matrix, if not empty, otherwise use identity matrix).		''QN InitMatrix ''(Initial Quasi-Newton matrix, if not empty, otherwise use identity matrix).
	\|-		\|-

2011-07-17T18:01:14Z

Description of Outputs

← Older revision		Revision as of 13:01, 17 July 2011
Line 140:		Line 140:
	\|\|\|''J_k''\|\|Jacobian matrix at optimum.		\|\|\|''J_k''\|\|Jacobian matrix at optimum.
	\|-		\|-
	\|\|\|''xState''\|\|State of each variable, described in ~~Table 150~~.		\|\|\|''xState''\|\|State of each variable, described in [[TOMLAB Appendix B]].
	\|-		\|-
	\|\|\|''bState''\|\|State of each linear constraint, described in ~~Table 151.~~		\|\|\|''bState''\|\|State of each linear constraint, described in [[TOMLAB Appendix B]]
	\|-		\|-
	\|\|\|''Iter''\|\|Number of iterations.		\|\|\|''Iter''\|\|Number of iterations.

2011-07-17T17:59:51Z

2011-07-11T12:18:42Z