Data class for storing conic programs arising from optimal control. More...
#include <banded_cp.hpp>
Public Member Functions | |
BandedCP () | |
BandedCP (const BandedCP &rhs) | |
BooleanType | isLP () const |
BooleanType | isQP () const |
BooleanType | isSDP () const |
BandedCP & | operator= (const BandedCP &rhs) |
virtual | ~BandedCP () |
Public Attributes | |
BlockMatrix ** | B |
BlockMatrix | constraintGradient |
BlockMatrix | deltaX |
BlockMatrix | dynGradient |
BlockMatrix | dynResiduum |
BlockMatrix | hessian |
BlockMatrix | lambdaBound |
BlockMatrix | lambdaConstraint |
BlockMatrix | lambdaDynamic |
BlockMatrix * | lbB |
BlockMatrix | lowerBoundResiduum |
BlockMatrix | lowerConstraintResiduum |
int | nS |
BlockMatrix | objectiveGradient |
BlockMatrix * | ubB |
BlockMatrix | upperBoundResiduum |
BlockMatrix | upperConstraintResiduum |
BlockMatrix ** | ylbB |
BlockMatrix ** | yubB |
Protected Member Functions | |
void | clean () |
void | copy (const BandedCP &rhs) |
Data class for storing conic programs arising from optimal control.
The class BandedCP (banded conic programs) is a data class to store conic programs that arise in the context of optimal control.
Definition at line 56 of file banded_cp.hpp.
Default constructor.
Definition at line 43 of file banded_cp.cpp.
BandedCP::BandedCP | ( | const BandedCP & | rhs | ) |
Copy constructor (deep copy).
Definition at line 56 of file banded_cp.cpp.
BandedCP::~BandedCP | ( | ) | [virtual] |
Destructor.
Definition at line 62 of file banded_cp.cpp.
void BandedCP::clean | ( | ) | [protected] |
Definition at line 154 of file banded_cp.cpp.
void BandedCP::copy | ( | const BandedCP & | rhs | ) | [protected] |
Definition at line 80 of file banded_cp.cpp.
BooleanType BandedCP::isLP | ( | ) | const [inline] |
Returns whether or not the conic program is an LP
BooleanType BandedCP::isQP | ( | ) | const [inline] |
Returns whether or not the conic program is an LP
BooleanType BandedCP::isSDP | ( | ) | const [inline] |
Returns whether or not the conic program is an SDP
Assignment operator (deep copy).
Definition at line 68 of file banded_cp.cpp.
SDP constraint tensor
Definition at line 116 of file banded_cp.hpp.
the gradient of the constraints
Definition at line 112 of file banded_cp.hpp.
Primal solution of the banded QP
Definition at line 123 of file banded_cp.hpp.
the sensitivities of the ODE/DAE
Definition at line 109 of file banded_cp.hpp.
residuum of the ODE/DAE
Definition at line 110 of file banded_cp.hpp.
the Hessian matrix
Definition at line 103 of file banded_cp.hpp.
Dual solution w.r.t. bounds
Definition at line 124 of file banded_cp.hpp.
Dual solution w.r.t. constraints
Definition at line 126 of file banded_cp.hpp.
Dual solution w.r.t. constraints
Definition at line 125 of file banded_cp.hpp.
SDP lower bounds
Definition at line 117 of file banded_cp.hpp.
lower residuum of the bounds
Definition at line 106 of file banded_cp.hpp.
lower residuum of the constraints
Definition at line 113 of file banded_cp.hpp.
int BandedCP::nS |
Number of SDP constraints
Definition at line 96 of file banded_cp.hpp.
the gradient of the objective
Definition at line 104 of file banded_cp.hpp.
SDP upper bounds
Definition at line 118 of file banded_cp.hpp.
upper residuum of the bounds
Definition at line 107 of file banded_cp.hpp.
upper residuum of the constraints
Definition at line 114 of file banded_cp.hpp.
Dual solution, SDB lower bound
Definition at line 128 of file banded_cp.hpp.
Dual solution, SDP upper bound
Definition at line 129 of file banded_cp.hpp.