Documentation/Modules/BoundHandler - Versionsgeschichte

Dirk: /* Properties */

2015-10-25T11:26:46Z

‎Properties

Dirk: /* Module Description */

2015-10-25T11:25:56Z

‎Module Description

Dirk: /* Properties */

2015-10-25T11:11:30Z

‎Properties

Dirk: Created page with "==Summary== Some optimizations require bounds on the design variables '''xxx'''. E.g. for the diameter of any mechanical support must be above a certain minimum value. As not a..."

2013-03-18T21:48:07Z

Created page with "==Summary== Some optimizations require bounds on the design variables '''xxx'''. E.g. for the diameter of any mechanical support must be above a certain minimum value. As not a..."

Neue Seite

==Summary==

Some optimizations require bounds on the design variables '''xxx'''. E.g. for the diameter of any mechanical support must be above a certain minimum value.

As not all optimization algorithms include bound handling, the module <code>BoundHandler</code> was created.

==Properties==

===General===

{| class="wikitable" style="text-align:left" border="2" cellpadding="5" cellspacing="5"
|-
! Algorithm
| deterministic.
|-
! Design Variables
| Continuous variables, discrete or mixed variables are possible.
|-
! Objectives
| any number.
|-
! Constraints
| any number.
|-
! Boundaries
| Design variables values outside the boundaries are corrected.
|-
! Initial Search Region
| not affected.
|-
! Typical X
| not affected.
|-
! Initialization
| not required.
|-
|}

===Connections===
{| class="wikitable" style="text-align:left" border="1" cellpadding="5" cellspacing="0"
|-
! Starting at his module
| One connection of type <code>optimization</code>
|-
! Ending at this module
| One connection of type <code>optimization</code>
|-
|}

===Actions===
{| class="wikitable" style="text-align:left" border="1" cellpadding="5" cellspacing="0"
|-
! Name !! Description
|-
! -
| -
|-
|}

===Options===
The options are currently described as "pop-up help".

==Module Description==

Any optimization algorithm proposes a new solution '''x'''. Some of the values of '''x''' might be outside the lower bounds xl and upper bounds xu, specified in the "Problem" module. These variables are corrected to values within the bounds by two different methods:

1. set to bounds

If one of the variables x is below or above the bounds, it is set to the bound value, i.e.

if x < xl, then x = xl
else if x > xu, then x = xu

2. reflect

If one of the variables x is below or above the bounds, it is reflected from the bound.
The reflection is done such that if x goes to infinity, x is equal to the lower bound and if x goes to
minus infinity, it is set to the upper bound.

if x < xl, then x = xu + (xl- xu) / (x - xu) * (xl- xu);

else if x > xu, then x = xl + (xu- xl) / (x - xl) * (xu- xl)

==Usage==
-
==Source Code==

ToDo:Link to SVN

==References==

-

@@ Zeile 63: / Zeile 63: @@
 ==Module Description==
-Any optimization algorithm proposes a new solution '''x'''. Some of the values of '''x''' might be outside the lower bounds x<sub>l</sub> and upper bounds x<sub>u</sub>, specified in the "Problem" module. These variables are corrected to values within the bounds by two different methods:
+The optimization algorithm proposes one or several new solutions '''x'''. Some values of '''x''' might be outside the lower bounds x<sub>l</sub> and upper bounds x<sub>u</sub>, specified in the "Problem" module. These variables are corrected to values within the bounds by thress different methods:
 . set to bounds
@@ Zeile 78: / Zeile 82: @@
 minus infinity, it is set to the upper bound.
-     if x < x<sub>l</sub>, then x = x<sub>u</sub> + (x<sub>l</sub>- x<sub>u</sub>) / (x - x<sub>u</sub>) * (x<sub>l</sub>- x<sub>u</sub>);
+     if x < x<sub>l</sub>, then x = x<sub>u</sub> + (x<sub>l</sub>- x<sub>u</sub>)^2 / (x - x<sub>u</sub>)
-     else if x > x<sub>u</sub>, then x = x<sub>l</sub> + (x<sub>u</sub>- x<sub>l</sub>) / (x - x<sub>l</sub>) * (x<sub>u</sub>- x<sub>l</sub>)
+     else if x > x<sub>u</sub>, then x = x<sub>l</sub> + (x<sub>u</sub>- x<sub>l</sub>)^2 / (x - x<sub>l</sub>)
 ==Usage==

@@ Zeile 12: / Zeile 12: @@
 |-
 ! Algorithm
-| deterministic
+| deterministic (as no gradient handling is implemented)
 |-
 ! Design Variables

@@ Zeile 12: / Zeile 12: @@
 |-
 ! Algorithm
-| deterministic.
+| deterministic
 |-
 ! Design Variables
-| Continuous variables, discrete or mixed variables are possible.
+| continuous variables, discrete or mixed variables are possible.
 |-
 ! Objectives
-| any number.
+| any number
 |-
 ! Constraints
-| any number.
+| any number
 |-
 ! Boundaries
-| Design variables values outside the boundaries are corrected.
+| Design variables values outside the boundaries are corrected
 |-
 ! Initial Search Region
-| not affected.
+| not affected
 |-
 ! Typical X
-| not affected.
+| not affected
 |-
 ! Initialization
-| not required.
+| not required
 |-
 |}