Changeset 1633 for coliny/trunk/doc/uguide/soliswets.doc

Timestamp:

10/23/01 17:58:19 (7 years ago)

Author:

DEVsgopt

Message:

Author: WEH
Notes : Final update of documentation for Version 2.0 release.

(See http://endo.sandia.gov/DAKOTA/lists.html for pointers to the archived list)

Files:

• coliny/trunk/doc/uguide/soliswets.doc (modified) (3 diffs)

coliny/trunk/doc/uguide/soliswets.doc

@@ -7 +7 @@
 
 The class SWOpt provides a framework for implementing the
-stochastic direct search algorithms described by Solis and
-\if GeneratingLaTeX \latexonly Wets~\cite{SolWet81}.  \endlatexonly \endif
-\if GeneratingHTML Wets [SolWet81].  \endif
-\if GeneratingLaTeX \latexonly Figure~\ref{swfig} \endlatexonly \endif
-\if GeneratingHTML Figure <b>SW-1</b> \endif
+stochastic direct search algorithms described by Solis and \if GeneratingLaTeX \latexonly Wets~\cite{SolWet81}.  \endlatexonly \endif \if GeneratingHTML Wets [SolWet81].  \endif \if GeneratingLaTeX \latexonly Figure~\ref{swfig} \endlatexonly \endif \if GeneratingHTML Figure <b>SW-1</b> \endif
 provides pseudo-code for the
 main loop of SWOpt.  These algorithms generate a new iterate using
-coordinate-wise iterates.  If the new iterate is better than the
+coordinate-wise steps.  If the new iterate is better than the
 current iterate then it is accepted and the algorithm repeats.
 Otherwise the algorithm considers a step in the opposite direction.  If
@@ -105 +101 @@
   
   if (n_succ >= max_succ)
-     n\_succ=0
+     n_succ=0
      rho = ex_factor * rho
   endif
@@ -115 +111 @@
 \endcode
 
-\b SW-1: Pseudo-code for the Solis-Wets algorithms.
+<b> SW-1:</b> Pseudo-code for the Solis-Wets algorithms.
 \endif