#include <ConstrainedOptPack_ConstraintsRelaxedStd.hpp>
Inheritance diagram for ConstrainedOptPack::QPSchurPack::ConstraintsRelaxedStd:
Public member functions  
void  bounds_tol (const value_type &bounds_tol) 
<<std comp="">> members for feasibility tolerance for the bound constriants.  
void  inequality_tol (const value_type &inequality_tol) 
<<std comp="">> members for feasibility tolerance for the general inequality constraints.  
void  equality_tol (const value_type &equality_tol) 
<<std comp="">> members for feasibility tolerance for the general equality constriants.  
void  inequality_pick_policy (const EInequalityPickPolicy &inequality_pick_policy) 
<<std comp="">> members for policy used to select a violated constraint.  
ConstraintsRelaxedStd ()  
Constructs to uninitialized.  
void  initialize (const VectorSpace::space_ptr_t &space_d_eta, value_type etaL, const Vector *dL, const Vector *dU, const MatrixOp *E, BLAS_Cpp::Transp trans_E, const Vector *b, const Vector *eL, const Vector *eU, const MatrixOp *F, BLAS_Cpp::Transp trans_F, const Vector *f, size_type m_undecomp, const size_type j_f_undecomp[], VectorMutable *Ed, bool check_F=true, value_type bounds_tol=1e10, value_type inequality_tol=1e10, value_type equality_tol=1e10) 
Initialize constriants.  
const MatrixConstraints &  A_bar_relaxed () const 
 
Overridden from Constraints  
size_type  n () const 
 
size_type  m_breve () const 
 
const MatrixOp &  A_bar () const 
Represents the constraints matrix.  
void  pick_violated_policy (EPickPolicy pick_policy) 
 
EPickPolicy  pick_violated_policy () const 
 
void  pick_violated (const DVectorSlice &x, size_type *j_viol, value_type *constr_val, value_type *viol_bnd_val, value_type *norm_2_constr, EBounds *bnd, bool *can_ignore) const 
Here the next violated constraint to add to the active set is selected.  
void  ignore (size_type j) 
 
value_type  get_bnd (size_type j, EBounds bnd) const 
 
Public Types  
enum  EInequalityPickPolicy 
More... 
The generic constraints represented by this class are those of the QPSolverRelaxed
interface which are:
(1.2) etaL <= eta (1.3) dL <= d <= dU (1.4) eL <= op(E)*d  b*eta <= eU (1.5) P_u'*op(F)*d + (1  eta) * P_u'*f = 0
[ dL ] [ I ] [ dU ] [ etaL ] <= [ 1 ] * [ d ] <= [ inf ] (2) [ eL ] [ op(E) b ] [ eta ] [ eU ] [ P_u'*f ] [ P_u'*op(F) P_u'*f ] [ P_u'*f ] \_________/ \______________________/ \_____/ \_________/ cL_bar A_bar' x cU_bar => (3) [ xl ] [ I ] [ xu ] [ cl_breve ] <= [ A_breve' ] * x <= [ cu_breve ] => (4) cl_bar <= A_bar'*x <= cu_bar
MatrixOp
object for A_bar
shown in (2) and to pick violated constraints.
Definition at line 76 of file ConstrainedOptPack_ConstraintsRelaxedStd.hpp.

Definition at line 211 of file ConstrainedOptPack_ConstraintsRelaxedStd.hpp. 

Constructs to uninitialized.
Definition at line 89 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

<<std comp="">> members for feasibility tolerance for the bound constriants.
Definition at line 222 of file ConstrainedOptPack_ConstraintsRelaxedStd.hpp. 

<<std comp="">> members for feasibility tolerance for the general inequality constraints.
Definition at line 226 of file ConstrainedOptPack_ConstraintsRelaxedStd.hpp. 

<<std comp="">> members for feasibility tolerance for the general equality constriants.
Definition at line 230 of file ConstrainedOptPack_ConstraintsRelaxedStd.hpp. 

<<std comp="">> members for policy used to select a violated constraint.
Definition at line 234 of file ConstrainedOptPack_ConstraintsRelaxedStd.hpp. 

Initialize constriants.
If there are no variable bounds then set:
If there are no general inequality constraints then set:
If there are no general equality constraints then set:
If
Here, ToDo: Specify more concretely exactly what the criteria is for considering that a constraint is violated or in picking the most violated constraint.
Definition at line 103 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Definition at line 225 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 232 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 237 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Represents the constraints matrix.
A_bar = [ I 0 op(E') op(F')*P_u ] [ 0 1 b' f'*P_u ] Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 242 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 247 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 262 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Here the next violated constraint to add to the active set is selected. Violated constraints are selected to to add to the active set in the following order:
As a side effect, the vector pointed to by
Ed was updated and therefore the client must compute this value on its own.
Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 277 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 493 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 

Implements ConstrainedOptPack::QPSchurPack::Constraints. Definition at line 501 of file ConstrainedOptPack_ConstraintsRelaxedStd.cpp. 