Dcp2Cone-class: Reduce DCP Problem to Conic Form

In anqif/CVXR: Disciplined Convex Optimization

Reduce DCP Problem to Conic Form

Description

This reduction takes as input (minimization) DCP problems and converts them into problems with affine objectives and conic constraints whose arguments are affine.

Usage

## S4 method for signature 'Dcp2Cone,Problem'
accepts(object, problem)

## S4 method for signature 'Dcp2Cone,Problem'
perform(object, problem)

Arguments

object	A Dcp2Cone object.
problem	A Problem object.

Methods (by generic)

• accepts(object = Dcp2Cone, problem = Problem): A problem is accepted if it is a minimization and is DCP.

• perform(object = Dcp2Cone, problem = Problem): Converts a DCP problem to a conic form.

anqif/CVXR documentation built on Feb. 6, 2024, 4:28 a.m.