Reductions¶
A Reduction
is a transformation
from one problem to an equivalent problem. Two problems are equivalent
if a solution of one can be converted to a solution of the other with no
more than a moderate amount of effort. CVXPY uses reductions to rewrite
problems into forms that solvers will accept.
Reductions allow CVXPY to simplify problems and target different categories of solvers (quadratic program solvers and conic solvers are two examples of solver categories). Appropriating terminology from software compilers, we classify reductions as either middleend reductions or backend reductions. A reduction that simplifies a source problem without regard to the targeted solver is called a middleend reduction, whereas a reduction that takes a source problem and converts it to a form acceptable to a category of solvers is called a backend reduction. Each solver (along with the mode in which it is invoked) is called a backend or target.
The majority of users will not need to know anything about the reduction API; indeed, most users need not even know that reductions exist. But those who wish to extend CVXPY or contribute to it may find the API useful, as might those who are simply curious to learn how CVXPY works.
Solution¶

class
cvxpy.reductions.solution.
Solution
(status, opt_val, primal_vars, dual_vars, attr)[source]¶ Bases:
object
A solution to an optimization problem.

status
¶ str – The status code.

opt_val
¶ float – The optimal value.

primal_vars
¶ dict of id to NumPy ndarray – A map from variable ids to optimal values.

dual_vars
¶ dict of id to NumPy ndarray – A map from constraint ids to dual values.

attr
¶ dict – Miscelleneous information propagated up from a solver.

Reduction¶

class
cvxpy.reductions.reduction.
Reduction
[source]¶ Bases:
object
Abstract base class for reductions.
A reduction is an actor that transforms a problem into an equivalent problem. By equivalent we mean that there exists a mapping between solutions of either problem: if we reduce a problem \(A\) to another problem \(B\) and then proceed to find a solution to \(B\), we can convert it to a solution of \(A\) with at most a moderate amount of effort.
Every reduction supports three methods: accepts, apply, and invert. The accepts method of a particular reduction codifies the types of problems that it is applicable to; the apply method takes a problem and reduces it to a (new) equivalent form, and the invert method maps solutions from reducedto problems to their problems of provenance.

__init__
¶ x.__init__(…) initializes x; see help(type(x)) for signature

accepts
(problem)[source]¶ States whether the reduction accepts a problem.
Parameters: problem (Problem) – The problem to check. Returns: True if the reduction can be applied, False otherwise. Return type: bool

apply
(problem)[source]¶ Applies the reduction to a problem and returns an equivalent problem.
Parameters: problem (Problem) – The problem to which the reduction will be applied. Returns:  Problem or dict – An equivalent problem, encoded either as a Problem or a dict.
 InverseData, list or dict – Data needed by the reduction in order to invert this particular application.

invert
(solution, inverse_data)[source]¶ Returns a solution to the original problem given the inverse_data.
Parameters:  solution (Solution) – A solution to a problem that generated the inverse_data.
 inverse_data – The data encoding the original problem.
Returns: A solution to the original problem.
Return type:

Chain¶

class
cvxpy.reductions.chain.
Chain
(reductions=[])[source]¶ Bases:
cvxpy.reductions.reduction.Reduction
A logical grouping of multiple reductions into a single reduction.

reductions
¶ list[Reduction] – A list of reductions.

accepts
(problem)[source]¶ A problem is accepted if the sequence of reductions is valid.
In particular, the ith reduction must accept the output of the i1th reduction, with the first reduction (self.reductions[0]) in the sequence taking as input the supplied problem.
Parameters: problem (Problem) – The problem to check. Returns: True if the chain can be applied, False otherwise. Return type: bool

apply
(problem)[source]¶ Applies the chain to a problem and returns an equivalent problem.
Parameters: problem (Problem) – The problem to which the chain will be applied. Returns:  Problem or dict – The problem yielded by applying the reductions in sequence, starting at self.reductions[0].
 list – The inverse data yielded by each of the reductions.

SolvingChain¶

class
cvxpy.reductions.solvers.solving_chain.
SolvingChain
(reductions=[])[source]¶ Bases:
cvxpy.reductions.chain.Chain
A reduction chain that ends with a solver.
Parameters: reductions (list[Reduction]) – A list of reductions. The last reduction in the list must be a solver instance. 
reductions
¶ list[Reduction] – A list of reductions.

solver
¶ Solver – The solver, i.e., reductions[1].

solve
(problem, warm_start, verbose, solver_opts)[source]¶ Solves the problem by applying the chain.
Applies each reduction in the chain to the problem, solves it, and then inverts the chain to return a solution of the supplied problem.
Parameters:  problem (Problem) – The problem to solve.
 warm_start (bool) – Whether to warm start the solver.
 verbose (bool) – Whether to enable solver verbosity.
 solver_opts (dict) – Solver specific options.
Returns: solution – A solution to the problem.
Return type:

solve_via_data
(problem, data, warm_start, verbose, solver_opts)[source]¶ Solves the problem using the data output by the an apply invocation.
The semantics are:
data, inverse_data = solving_chain.apply(problem) solution = solving_chain.invert(solver_chain.solve_via_data(data, ...))
which is equivalent to writing
solution = solving_chain.solve(problem, ...)
Parameters:  problem (Problem) – The problem to solve.
 data (map) – Data for the solver.
 warm_start (bool) – Whether to warm start the solver.
 verbose (bool) – Whether to enable solver verbosity.
 solver_opts (dict) – Solver specific options.
Returns: The information returned by the solver; this is not necessarily a Solution object.
Return type: raw solver solution
