biVdZddlZddlmZddlmZddlmZddl m Z GddeZ y) a, Copyright 2018 Akshay Agrawal Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. N)settings) Expression)Canonicalization)DgpCanonMethodscXeZdZdZd d fd ZdZfdZ d dedede fdZ fd Z xZ S) Dgp2Dcpa,Reduce DGP problems to DCP problems. This reduction takes as input a DGP problem and returns an equivalent DCP problem. Because every (generalized) geometric program is a DGP problem, this reduction can be used to convert geometric programs into convex form. Example ------- >>> import cvxpy as cp >>> >>> x1 = cp.Variable(pos=True) >>> x2 = cp.Variable(pos=True) >>> x3 = cp.Variable(pos=True) >>> >>> monomial = 3.0 * x_1**0.4 * x_2 ** 0.2 * x_3 ** -1.4 >>> posynomial = monomial + 2.0 * x_1 * x_2 >>> dgp_problem = cp.Problem(cp.Minimize(posynomial), [monomial == 4.0]) >>> >>> dcp2cone = cvxpy.reductions.Dcp2Cone() >>> assert not dcp2cone.accepts(dgp_problem) >>> >>> gp2dcp = cvxpy.reductions.Dgp2Dcp(dgp_problem) >>> dcp_problem = gp2dcp.reduce() >>> >>> assert dcp2cone.accepts(dcp_problem) >>> dcp_problem.solve() >>> >>> dgp_problem.unpack(gp2dcp.retrieve(dcp_problem.solution)) >>> print(dgp_problem.value) >>> print(dgp_problem.variables()) c0tt| d|y)N) canon_methodsproblem)superr__init__)selfr __class__s [/home/cdr/jupyterlab/.venv/lib/python3.12/site-packages/cvxpy/reductions/dgp2dcp/dgp2dcp.pyr zDgp2Dcp.__init__9s gt%D'%Jc"|jS)z,A problem is accepted if it is DGP. )is_dgp)rr s racceptszDgp2Dcp.accepts>s~~rc|j|s tdt|_tt ||\}}||_||fS)z1Converts a DGP problem to a DCP problem. z The supplied problem is not DGP.)r ValueErrorrr r rapply_problem)rr equiv_problem inverse_datars rrz Dgp2Dcp.applyCsQ||G$?@ @,.&+GT&@&I# | ' l**rexprargscanonicalize_paramsct||jvr|jt|||S|j|gfS)awCanonicalize an expression, w.r.t. canonicalized arguments. Args: expr: Expression to canonicalize. args: Arguments to the expression. canonicalize_params: Should constant subtrees containing parameters be canonicalized? Returns: canonicalized expression, constraints )typer copy)rrrrs rcanonicalize_exprzDgp2Dcp.canonicalize_exprNsG" :++ +14%%d4j1$= =99T?B& &rc>tt| ||}|jtj k(r|S|j jD]'\}}tj||j |<)tj|j|_ |SN) r rinvertstatusr SOLVER_ERROR primal_varsitemsnpexpopt_val)rsolutionrvidvaluers rr$zDgp2Dcp.invertds$.xF ??h33 3O"..446 6JC(*u H  % 666("2"23rr#)returnN)T) __name__ __module__ __qualname____doc__r rrrlistboolr!r$ __classcell__)rs@rrrsI@K  +)- '''"& ',rr) r3numpyr)cvxpyrcvxpy.expressions.expressionr!cvxpy.reductions.canonicalizationr'cvxpy.reductions.dgp2dcp.canonicalizersrrrrr=s*3>CTTr