spaceteams.SC_Compute_Server.math.optimal.cone
¶
ConeConstraint
¶
Evaluate
¶
Evaluate(x: Annotated[ArrayLike, float64, '[m, 1]'], e: Annotated[ArrayLike, float64, '[m, 1]'], varType: VariableType) -> bool
Evaluates whether the vector 'x' is within this cone (dependent on what type of variable 'x' is)
ConeType
¶
ConeType(value: SupportsInt)
ConvergenceResults
¶
Epsilons
¶
MNCoordinates
¶
OptimizationResults
¶
qcpState
property
¶
qcpState: QCPState
The optimal (if converged) or final (if not converged) state of the problem
QCPState
¶
QCPStatus
¶
QCPStatus(value: SupportsInt)
QuadraticConeProblem
¶
QuadraticConeProblem(A_eq: Annotated[ArrayLike, float64, '[m, n]'], b_eq: Annotated[ArrayLike, float64, '[m, 1]'], P_cost: Annotated[ArrayLike, float64, '[m, n]'], c_cost: Annotated[ArrayLike, float64, '[m, 1]'], coneConstraints: Sequence[ConeConstraint], n: SupportsInt, n_i: SupportsInt, m: SupportsInt, p: SupportsInt, l: SupportsInt, q: SupportsInt)
G
property
¶
G: Annotated[NDArray[float64], '[m, n]']
Assembled G matrix of cone constraints (h - G*x in cone K)
P_cost
property
¶
P_cost: Annotated[NDArray[float64], '[m, n]']
P matrix in performance index (J = 0.5x^TPx + c^Tx)
c_cost
property
¶
c_cost: Annotated[NDArray[float64], '[m, 1]']
c vector in performance index (J = 0.5x^TPx + c^Tx)
h
property
¶
h: Annotated[NDArray[float64], '[m, 1]']
Assembled h vector of cone constraints (h - G*x in cone K)
SolveProblem
¶
SolveProblem(absTol: SupportsFloat = 1e-06, relTol: SupportsFloat = 1e-06, maxIterations: SupportsInt = 200) -> OptimizationResults
Solves the quadratic second-order cone optimization problem
VariableType
¶
VariableType(value: SupportsInt)
Members:
X : State variables
S : Slack variables
Y : Dual variables (costates)
Z : Dual slack variables