#include <example_04.hpp>
Inheritance diagram for L2BoundConstraint< Real >:
Public Member Functions | |
| L2BoundConstraint (std::vector< Real > &l, std::vector< Real > &u, const ROL::Ptr< BurgersFEM< Real > > &fem, Real scale=1.0) | |
| bool | isFeasible (const ROL::Vector< Real > &x) |
| Check if the vector, v, is feasible. More... | |
| void | project (ROL::Vector< Real > &x) |
| Project optimization variables onto the bounds. More... | |
| void | pruneLowerActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the lower \(\epsilon\)-active set. More... | |
| void | pruneUpperActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the upper \(\epsilon\)-active set. More... | |
| void | pruneActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| void | pruneLowerActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the \(\epsilon\)-binding set. More... | |
| void | pruneUpperActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the upper \(\epsilon\)-binding set. More... | |
| void | pruneActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| const ROL::Ptr< const ROL::Vector< Real > > | getLowerBound (void) const |
| Return the ref count pointer to the lower bound vector. More... | |
| const ROL::Ptr< const ROL::Vector< Real > > | getUpperBound (void) const |
| Return the ref count pointer to the upper bound vector. More... | |
| L2BoundConstraint (std::vector< Real > &l, std::vector< Real > &u, const ROL::Ptr< BurgersFEM< Real > > &fem, Real scale=1.0) | |
| bool | isFeasible (const ROL::Vector< Real > &x) |
| Check if the vector, v, is feasible. More... | |
| void | project (ROL::Vector< Real > &x) |
| Project optimization variables onto the bounds. More... | |
| void | pruneLowerActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the lower \(\epsilon\)-active set. More... | |
| void | pruneUpperActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the upper \(\epsilon\)-active set. More... | |
| void | pruneActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| void | pruneLowerActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the \(\epsilon\)-binding set. More... | |
| void | pruneUpperActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the upper \(\epsilon\)-binding set. More... | |
| void | pruneActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| const ROL::Ptr< const ROL::Vector< Real > > | getLowerBound (void) const |
| Return the ref count pointer to the lower bound vector. More... | |
| const ROL::Ptr< const ROL::Vector< Real > > | getUpperBound (void) const |
| Return the ref count pointer to the upper bound vector. More... | |
| L2BoundConstraint (std::vector< Real > &l, std::vector< Real > &u, const ROL::Ptr< BurgersFEM< Real > > &fem, Real scale=1.0) | |
| bool | isFeasible (const ROL::Vector< Real > &x) |
| Check if the vector, v, is feasible. More... | |
| void | project (ROL::Vector< Real > &x) |
| Project optimization variables onto the bounds. More... | |
| void | pruneLowerActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the lower \(\epsilon\)-active set. More... | |
| void | pruneUpperActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the upper \(\epsilon\)-active set. More... | |
| void | pruneActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &x, Real eps) |
| void | pruneLowerActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the \(\epsilon\)-binding set. More... | |
| void | pruneUpperActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| Set variables to zero if they correspond to the upper \(\epsilon\)-binding set. More... | |
| void | pruneActive (ROL::Vector< Real > &v, const ROL::Vector< Real > &g, const ROL::Vector< Real > &x, Real eps) |
| const ROL::Ptr< const ROL::Vector< Real > > | getLowerBound (void) const |
| Return the ref count pointer to the lower bound vector. More... | |
| const ROL::Ptr< const ROL::Vector< Real > > | getUpperBound (void) const |
| Return the ref count pointer to the upper bound vector. More... | |
| Public Member Functions inherited from ROL::BoundConstraint< Real > | |
| virtual | ~BoundConstraint () |
| BoundConstraint (void) | |
| BoundConstraint (const Vector< Real > &x) | |
| virtual void | update (const Vector< Real > &x, bool flag=true, int iter=-1) |
| Update bounds. More... | |
| virtual void | projectInterior (Vector< Real > &x) |
| Project optimization variables into the interior of the feasible set. More... | |
| void | activateLower (void) |
| Turn on lower bound. More... | |
| void | activateUpper (void) |
| Turn on upper bound. More... | |
| void | activate (void) |
| Turn on bounds. More... | |
| void | deactivateLower (void) |
| Turn off lower bound. More... | |
| void | deactivateUpper (void) |
| Turn off upper bound. More... | |
| void | deactivate (void) |
| Turn off bounds. More... | |
| bool | isLowerActivated (void) const |
| Check if lower bound are on. More... | |
| bool | isUpperActivated (void) const |
| Check if upper bound are on. More... | |
| bool | isActivated (void) const |
| Check if bounds are on. More... | |
| void | pruneActive (Vector< Real > &v, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-active set. More... | |
| void | pruneActive (Vector< Real > &v, const Vector< Real > &g, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-binding set. More... | |
| void | pruneLowerInactive (Vector< Real > &v, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-inactive set. More... | |
| void | pruneUpperInactive (Vector< Real > &v, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-inactive set. More... | |
| void | pruneLowerInactive (Vector< Real > &v, const Vector< Real > &g, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-nonbinding set. More... | |
| void | pruneUpperInactive (Vector< Real > &v, const Vector< Real > &g, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-nonbinding set. More... | |
| void | pruneInactive (Vector< Real > &v, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-inactive set. More... | |
| void | pruneInactive (Vector< Real > &v, const Vector< Real > &g, const Vector< Real > &x, Real eps=0) |
| Set variables to zero if they correspond to the \(\epsilon\)-nonbinding set. More... | |
| void | computeProjectedGradient (Vector< Real > &g, const Vector< Real > &x) |
| Compute projected gradient. More... | |
| void | computeProjectedStep (Vector< Real > &v, const Vector< Real > &x) |
| Compute projected step. More... | |
Private Member Functions | |
| void | cast_vector (ROL::Ptr< std::vector< Real > > &xvec, ROL::Vector< Real > &x) const |
| void | cast_const_vector (ROL::Ptr< const std::vector< Real > > &xvec, const ROL::Vector< Real > &x) const |
| void | axpy (std::vector< Real > &out, const Real a, const std::vector< Real > &x, const std::vector< Real > &y) const |
| void | projection (std::vector< Real > &x) |
| void | cast_vector (ROL::Ptr< std::vector< Real > > &xvec, ROL::Vector< Real > &x) const |
| void | cast_const_vector (ROL::Ptr< const std::vector< Real > > &xvec, const ROL::Vector< Real > &x) const |
| void | axpy (std::vector< Real > &out, const Real a, const std::vector< Real > &x, const std::vector< Real > &y) const |
| void | projection (std::vector< Real > &x) |
| void | cast_vector (ROL::Ptr< std::vector< Real > > &xvec, ROL::Vector< Real > &x) const |
| void | cast_const_vector (ROL::Ptr< const std::vector< Real > > &xvec, const ROL::Vector< Real > &x) const |
| void | axpy (std::vector< Real > &out, const Real a, const std::vector< Real > &x, const std::vector< Real > &y) const |
| void | projection (std::vector< Real > &x) |
Private Attributes | |
| int | dim_ |
| std::vector< Real > | x_lo_ |
| std::vector< Real > | x_up_ |
| Real | min_diff_ |
| Real | scale_ |
| ROL::Ptr< BurgersFEM< Real > > | fem_ |
| ROL::Ptr< ROL::Vector< Real > > | l_ |
| ROL::Ptr< ROL::Vector< Real > > | u_ |
Detailed Description
template<class Real>
class L2BoundConstraint< Real >
Definition at line 1149 of file example_04.hpp.
Constructor & Destructor Documentation
◆ L2BoundConstraint() [1/3]
|
inline |
Definition at line 1195 of file example_04.hpp.
◆ L2BoundConstraint() [2/3]
|
inline |
Definition at line 1272 of file example_07.hpp.
◆ L2BoundConstraint() [3/3]
|
inline |
Definition at line 1082 of file example_08.hpp.
Member Function Documentation
◆ cast_vector() [1/3]
|
inlineprivate |
Definition at line 1160 of file example_04.hpp.
◆ cast_const_vector() [1/3]
|
inlineprivate |
Definition at line 1170 of file example_04.hpp.
◆ axpy() [1/3]
|
inlineprivate |
Definition at line 1180 of file example_04.hpp.
◆ projection() [1/3]
|
inlineprivate |
Definition at line 1188 of file example_04.hpp.
◆ isFeasible() [1/3]
|
inlinevirtual |
Check if the vector, v, is feasible.
This function returns true if \(v = P_{[a,b]}(v)\).
- Parameters
-
[in] v is the vector to be checked.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1214 of file example_04.hpp.
◆ project() [1/3]
|
inlinevirtual |
Project optimization variables onto the bounds.
This function implements the projection of \(x\) onto the bounds, i.e.,
\[ (P_{[a,b]}(x))(\xi) = \min\{b(\xi),\max\{a(\xi),x(\xi)\}\} \quad \text{for almost every }\xi\in\Xi. \]
- Parameters
-
[in,out] x is the optimization variable.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1226 of file example_04.hpp.
◆ pruneLowerActive() [1/6]
|
inlinevirtual |
Set variables to zero if they correspond to the lower \(\epsilon\)-active set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{A}^-_\epsilon(x)\). Here, the lower \(\epsilon\)-active set is defined as
\[ \mathcal{A}^-_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = a(\xi)+\epsilon\,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1231 of file example_04.hpp.
◆ pruneUpperActive() [1/6]
|
inlinevirtual |
Set variables to zero if they correspond to the upper \(\epsilon\)-active set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{A}^+_\epsilon(x)\). Here, the upper \(\epsilon\)-active set is defined as
\[ \mathcal{A}^+_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = b(\xi)-\epsilon\,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1242 of file example_04.hpp.
◆ pruneActive() [1/6]
|
inline |
Definition at line 1253 of file example_04.hpp.
◆ pruneLowerActive() [2/6]
|
inlinevirtual |
Set variables to zero if they correspond to the \(\epsilon\)-binding set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{B}^-_\epsilon(x)\). Here, the lower \(\epsilon\)-binding set is defined as
\[ \mathcal{B}^-_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = a(\xi)+\epsilon,\; g(\xi) > 0 \,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] g is the negative search direction. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1265 of file example_04.hpp.
◆ pruneUpperActive() [2/6]
|
inlinevirtual |
Set variables to zero if they correspond to the upper \(\epsilon\)-binding set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{B}^+_\epsilon(x)\). Here, the upper \(\epsilon\)-binding set is defined as
\[ \mathcal{B}^+_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = b(\xi)-\epsilon,\; g(\xi) < 0 \,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] g is the negative search direction. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1277 of file example_04.hpp.
◆ pruneActive() [2/6]
|
inline |
Definition at line 1289 of file example_04.hpp.
◆ getLowerBound() [1/3]
|
inlinevirtual |
Return the ref count pointer to the lower bound vector.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1302 of file example_04.hpp.
◆ getUpperBound() [1/3]
|
inlinevirtual |
Return the ref count pointer to the upper bound vector.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1306 of file example_04.hpp.
◆ cast_vector() [2/3]
|
inlineprivate |
Definition at line 1237 of file example_07.hpp.
◆ cast_const_vector() [2/3]
|
inlineprivate |
Definition at line 1247 of file example_07.hpp.
◆ axpy() [2/3]
|
inlineprivate |
Definition at line 1257 of file example_07.hpp.
◆ projection() [2/3]
|
inlineprivate |
Definition at line 1265 of file example_07.hpp.
◆ isFeasible() [2/3]
|
inlinevirtual |
Check if the vector, v, is feasible.
This function returns true if \(v = P_{[a,b]}(v)\).
- Parameters
-
[in] v is the vector to be checked.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1291 of file example_07.hpp.
◆ project() [2/3]
|
inlinevirtual |
Project optimization variables onto the bounds.
This function implements the projection of \(x\) onto the bounds, i.e.,
\[ (P_{[a,b]}(x))(\xi) = \min\{b(\xi),\max\{a(\xi),x(\xi)\}\} \quad \text{for almost every }\xi\in\Xi. \]
- Parameters
-
[in,out] x is the optimization variable.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1303 of file example_07.hpp.
◆ pruneLowerActive() [3/6]
|
inlinevirtual |
Set variables to zero if they correspond to the lower \(\epsilon\)-active set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{A}^-_\epsilon(x)\). Here, the lower \(\epsilon\)-active set is defined as
\[ \mathcal{A}^-_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = a(\xi)+\epsilon\,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1308 of file example_07.hpp.
◆ pruneUpperActive() [3/6]
|
inlinevirtual |
Set variables to zero if they correspond to the upper \(\epsilon\)-active set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{A}^+_\epsilon(x)\). Here, the upper \(\epsilon\)-active set is defined as
\[ \mathcal{A}^+_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = b(\xi)-\epsilon\,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1319 of file example_07.hpp.
◆ pruneActive() [3/6]
|
inline |
Definition at line 1330 of file example_07.hpp.
◆ pruneLowerActive() [4/6]
|
inlinevirtual |
Set variables to zero if they correspond to the \(\epsilon\)-binding set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{B}^-_\epsilon(x)\). Here, the lower \(\epsilon\)-binding set is defined as
\[ \mathcal{B}^-_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = a(\xi)+\epsilon,\; g(\xi) > 0 \,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] g is the negative search direction. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1342 of file example_07.hpp.
◆ pruneUpperActive() [4/6]
|
inlinevirtual |
Set variables to zero if they correspond to the upper \(\epsilon\)-binding set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{B}^+_\epsilon(x)\). Here, the upper \(\epsilon\)-binding set is defined as
\[ \mathcal{B}^+_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = b(\xi)-\epsilon,\; g(\xi) < 0 \,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] g is the negative search direction. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1354 of file example_07.hpp.
◆ pruneActive() [4/6]
|
inline |
Definition at line 1366 of file example_07.hpp.
◆ getLowerBound() [2/3]
|
inlinevirtual |
Return the ref count pointer to the lower bound vector.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1379 of file example_07.hpp.
◆ getUpperBound() [2/3]
|
inlinevirtual |
Return the ref count pointer to the upper bound vector.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1383 of file example_07.hpp.
◆ cast_vector() [3/3]
|
inlineprivate |
Definition at line 1047 of file example_08.hpp.
◆ cast_const_vector() [3/3]
|
inlineprivate |
Definition at line 1057 of file example_08.hpp.
◆ axpy() [3/3]
|
inlineprivate |
Definition at line 1067 of file example_08.hpp.
◆ projection() [3/3]
|
inlineprivate |
Definition at line 1075 of file example_08.hpp.
◆ isFeasible() [3/3]
|
inlinevirtual |
Check if the vector, v, is feasible.
This function returns true if \(v = P_{[a,b]}(v)\).
- Parameters
-
[in] v is the vector to be checked.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1101 of file example_08.hpp.
◆ project() [3/3]
|
inlinevirtual |
Project optimization variables onto the bounds.
This function implements the projection of \(x\) onto the bounds, i.e.,
\[ (P_{[a,b]}(x))(\xi) = \min\{b(\xi),\max\{a(\xi),x(\xi)\}\} \quad \text{for almost every }\xi\in\Xi. \]
- Parameters
-
[in,out] x is the optimization variable.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1113 of file example_08.hpp.
◆ pruneLowerActive() [5/6]
|
inlinevirtual |
Set variables to zero if they correspond to the lower \(\epsilon\)-active set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{A}^-_\epsilon(x)\). Here, the lower \(\epsilon\)-active set is defined as
\[ \mathcal{A}^-_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = a(\xi)+\epsilon\,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1118 of file example_08.hpp.
◆ pruneUpperActive() [5/6]
|
inlinevirtual |
Set variables to zero if they correspond to the upper \(\epsilon\)-active set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{A}^+_\epsilon(x)\). Here, the upper \(\epsilon\)-active set is defined as
\[ \mathcal{A}^+_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = b(\xi)-\epsilon\,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1129 of file example_08.hpp.
◆ pruneActive() [5/6]
|
inline |
Definition at line 1140 of file example_08.hpp.
◆ pruneLowerActive() [6/6]
|
inlinevirtual |
Set variables to zero if they correspond to the \(\epsilon\)-binding set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{B}^-_\epsilon(x)\). Here, the lower \(\epsilon\)-binding set is defined as
\[ \mathcal{B}^-_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = a(\xi)+\epsilon,\; g(\xi) > 0 \,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] g is the negative search direction. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1152 of file example_08.hpp.
◆ pruneUpperActive() [6/6]
|
inlinevirtual |
Set variables to zero if they correspond to the upper \(\epsilon\)-binding set.
This function sets \(v(\xi)=0\) if \(\xi\in\mathcal{B}^+_\epsilon(x)\). Here, the upper \(\epsilon\)-binding set is defined as
\[ \mathcal{B}^+_\epsilon(x) = \{\,\xi\in\Xi\,:\,x(\xi) = b(\xi)-\epsilon,\; g(\xi) < 0 \,\}. \]
- Parameters
-
[out] v is the variable to be pruned. [in] g is the negative search direction. [in] x is the current optimization variable. [in] eps is the active-set tolerance \(\epsilon\).
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1164 of file example_08.hpp.
◆ pruneActive() [6/6]
|
inline |
Definition at line 1176 of file example_08.hpp.
◆ getLowerBound() [3/3]
|
inlinevirtual |
Return the ref count pointer to the lower bound vector.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1189 of file example_08.hpp.
◆ getUpperBound() [3/3]
|
inlinevirtual |
Return the ref count pointer to the upper bound vector.
Reimplemented from ROL::BoundConstraint< Real >.
Definition at line 1193 of file example_08.hpp.
Member Data Documentation
◆ dim_
|
private |
Definition at line 1151 of file example_04.hpp.
◆ x_lo_
|
private |
Definition at line 1152 of file example_04.hpp.
◆ x_up_
|
private |
Definition at line 1153 of file example_04.hpp.
◆ min_diff_
|
private |
Definition at line 1154 of file example_04.hpp.
◆ scale_
|
private |
Definition at line 1155 of file example_04.hpp.
◆ fem_
|
private |
Definition at line 1156 of file example_04.hpp.
◆ l_
|
private |
Definition at line 1157 of file example_04.hpp.
◆ u_
|
private |
Definition at line 1158 of file example_04.hpp.
The documentation for this class was generated from the following files:
