Construct Matrices for Linear Cone Problems
Linear cone problems are assumed to have a linear objective and cone constraints, which may have zero or more arguments, all of which must be affine.
## S4 method for signature 'ConeMatrixStuffing,Problem' accepts(object, problem) ## S4 method for signature 'ConeMatrixStuffing,Problem,CoeffExtractor' stuffed_objective(object, problem, extractor)
object |
A ConeMatrixStuffing object. |
problem |
A Problem object. |
extractor |
Used to extract the affine coefficients of the objective. |
minimize c^Tx subject to cone_constr1(A_1*x + b_1, ...) ... cone_constrK(A_K*x + b_K, ...)
accepts
: Is the solver accepted?
stuffed_objective
: Returns a list of the stuffed matrices
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.