A composite composite BoundConstraint formed from bound constraints on subvectors of a PartitionedVector. More...

#include <ROL_BoundConstraint_Partitioned.hpp>

Inheritance diagram for ROL::BoundConstraint_Partitioned< Real >:

Public Member Functions
	~BoundConstraint_Partitioned ()

	BoundConstraint_Partitioned (const std::vector< ROL::Ptr< BoundConstraint< Real > > > &bnd, const std::vector< ROL::Ptr< Vector< Real > > > &x)

void	update (const Vector< Real > &x, bool flag=true, int iter=-1)
	Update bounds. More...

void	project (Vector< Real > &x)
	Project optimization variables onto the bounds. More...

void	projectInterior (Vector< Real > &x)
	Project optimization variables into the interior of the feasible set. More...

void	pruneUpperActive (Vector< Real > &v, const Vector< Real > &x, Real eps=0.0)
	Set variables to zero if they correspond to the upper \(\epsilon\)-active set. More...

void	pruneUpperActive (Vector< Real > &v, const Vector< Real > &g, const Vector< Real > &x, Real eps=0.0)
	Set variables to zero if they correspond to the upper \(\epsilon\)-binding set. More...

void	pruneLowerActive (Vector< Real > &v, const Vector< Real > &x, Real eps=0.0)
	Set variables to zero if they correspond to the lower \(\epsilon\)-active set. More...

void	pruneLowerActive (Vector< Real > &v, const Vector< Real > &g, const Vector< Real > &x, Real eps=0.0)
	Set variables to zero if they correspond to the \(\epsilon\)-binding set. More...

const ROL::Ptr< const Vector < Real > >	getLowerBound (void) const
	Return the ref count pointer to the lower bound vector. More...

const ROL::Ptr< const Vector < Real > >	getUpperBound (void) const
	Return the ref count pointer to the upper bound vector. More...

bool	isFeasible (const Vector< Real > &v)
	Check if the vector, v, is feasible. More...

Public Member Functions inherited from ROL::BoundConstraint< Real >
virtual	~BoundConstraint ()

	BoundConstraint (void)

	BoundConstraint (const Vector< Real > &x)

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 Types
typedef Vector< Real >	V

typedef PartitionedVector< Real >	PV

typedef std::vector< Real > ::size_type	uint

Private Attributes
std::vector< ROL::Ptr < BoundConstraint< Real > > >	bnd_

ROL::Ptr< V >	l_

ROL::Ptr< V >	u_

uint	dim_

bool	hasLvec_

bool	hasUvec_

Detailed Description

template<class Real>
class ROL::BoundConstraint_Partitioned< Real >

A composite composite BoundConstraint formed from bound constraints on subvectors of a PartitionedVector.

Definition at line 61 of file ROL_BoundConstraint_Partitioned.hpp.

Member Typedef Documentation

template<class Real >

typedef Vector<Real> ROL::BoundConstraint_Partitioned< Real >::V

private

Definition at line 63 of file ROL_BoundConstraint_Partitioned.hpp.

template<class Real >

typedef PartitionedVector<Real> ROL::BoundConstraint_Partitioned< Real >::PV

private

Definition at line 64 of file ROL_BoundConstraint_Partitioned.hpp.

template<class Real >

typedef std::vector<Real>::size_type ROL::BoundConstraint_Partitioned< Real >::uint

private

Definition at line 65 of file ROL_BoundConstraint_Partitioned.hpp.

Constructor & Destructor Documentation

template<class Real >

ROL::BoundConstraint_Partitioned< Real >::~BoundConstraint_Partitioned ( )

inline

Definition at line 79 of file ROL_BoundConstraint_Partitioned.hpp.

template<class Real >

ROL::BoundConstraint_Partitioned< Real >::BoundConstraint_Partitioned	(	const std::vector< ROL::Ptr< BoundConstraint< Real > > > &	bnd,
		const std::vector< ROL::Ptr< Vector< Real > > > &	x
	)

inline

Definition at line 81 of file ROL_BoundConstraint_Partitioned.hpp.

Member Function Documentation

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::update	(	const Vector< Real > &	x,
		bool	flag = `true`,
		int	iter = `-1`
	)

inlinevirtual

Update bounds.

The update function allows the user to update the bounds at each new iterations.

Parameters

[in]	x	is the optimization variable.
[in]	flag	is set to true if control is changed.
[in]	iter	is the outer algorithm iterations count.

Reimplemented from ROL::BoundConstraint< Real >.

Definition at line 141 of file ROL_BoundConstraint_Partitioned.hpp.

References ROL::BoundConstraint_Partitioned< Real >::bnd_, ROL::BoundConstraint_Partitioned< Real >::dim_, ROL::PartitionedVector< Real >::get(), and ROL::BoundConstraint< Real >::isActivated().

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::project ( Vector< Real > & x )

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 150 of file ROL_BoundConstraint_Partitioned.hpp.

References ROL::BoundConstraint_Partitioned< Real >::bnd_, ROL::BoundConstraint_Partitioned< Real >::dim_, ROL::PartitionedVector< Real >::get(), and ROL::BoundConstraint< Real >::isActivated().

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::projectInterior ( Vector< Real > & x )

inlinevirtual

Project optimization variables into the interior of the feasible set.

This function implements the projection of \(x\) into the interior of the feasible set, i.e.,

\[ (\bar{P}_{[a,b]}(x))(\xi) \in (a(\xi),b(\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 159 of file ROL_BoundConstraint_Partitioned.hpp.

References ROL::BoundConstraint_Partitioned< Real >::bnd_, ROL::BoundConstraint_Partitioned< Real >::dim_, ROL::PartitionedVector< Real >::get(), and ROL::BoundConstraint< Real >::isActivated().

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::pruneUpperActive	(	Vector< Real > &	v,
		const Vector< Real > &	x,
		Real	eps = `0.0`
	)

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 168 of file ROL_BoundConstraint_Partitioned.hpp.

References ROL::BoundConstraint_Partitioned< Real >::bnd_, ROL::BoundConstraint_Partitioned< Real >::dim_, ROL::PartitionedVector< Real >::get(), and ROL::BoundConstraint< Real >::isActivated().

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::pruneUpperActive	(	Vector< Real > &	v,
		const Vector< Real > &	g,
		const Vector< Real > &	x,
		Real	eps = `0.0`
	)

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 178 of file ROL_BoundConstraint_Partitioned.hpp.

References ROL::BoundConstraint_Partitioned< Real >::bnd_, ROL::BoundConstraint_Partitioned< Real >::dim_, ROL::PartitionedVector< Real >::get(), and ROL::BoundConstraint< Real >::isActivated().

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::pruneLowerActive	(	Vector< Real > &	v,
		const Vector< Real > &	x,
		Real	eps = `0.0`
	)

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 189 of file ROL_BoundConstraint_Partitioned.hpp.

References ROL::BoundConstraint_Partitioned< Real >::bnd_, ROL::BoundConstraint_Partitioned< Real >::dim_, ROL::PartitionedVector< Real >::get(), and ROL::BoundConstraint< Real >::isActivated().

template<class Real >

void ROL::BoundConstraint_Partitioned< Real >::pruneLowerActive	(	Vector< Real > &	v,
		const Vector< Real > &	g,
		const Vector< Real > &	x,
		Real	eps = `0.0`
	)

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\).