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 class 'ConeMatrixStuffing,Problem'
accepts(object, problem)
# S4 method for class 'ConeMatrixStuffing,Problem,CoeffExtractor'
stuffed_objective(object, problem, extractor)A ConeMatrixStuffing object.
A Problem object.
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(object = ConeMatrixStuffing, problem = Problem): Is the solver accepted?
stuffed_objective(
object = ConeMatrixStuffing,
problem = Problem,
extractor = CoeffExtractor
): Returns a list of the stuffed matrices