forked from cvxpy/cvxpy
-
Notifications
You must be signed in to change notification settings - Fork 2
/
tree_mat.py
426 lines (372 loc) · 11.8 KB
/
tree_mat.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
"""
Copyright 2013 Steven Diamond
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.
THIS FILE IS DEPRECATED AND MAY BE REMOVED WITHOUT WARNING!
DO NOT CALL THESE FUNCTIONS IN YOUR CODE!
"""
import cvxpy.interface as intf
import cvxpy.lin_ops.lin_op as lo
import copy
import numpy as np
from scipy.signal import fftconvolve
# Utility functions for treating an expression tree as a matrix
# and multiplying by it and it's transpose.
def mul(lin_op, val_dict, is_abs=False):
"""Multiply the expression tree by a vector.
Parameters
----------
lin_op : LinOp
The root of an expression tree.
val_dict : dict
A map of variable id to value.
is_abs : bool, optional
Multiply by the absolute value of the matrix?
Returns
-------
NumPy matrix
The result of the multiplication.
"""
# Look up the value for a variable.
if lin_op.type is lo.VARIABLE:
if lin_op.data in val_dict:
# Use absolute value of variable.
if is_abs:
return np.abs(val_dict[lin_op.data])
else:
return val_dict[lin_op.data]
# Defaults to zero if no value given.
else:
return np.mat(np.zeros(lin_op.shape))
# Return all zeros for NO_OP.
elif lin_op.type is lo.NO_OP:
return np.mat(np.zeros(lin_op.shape))
else:
eval_args = []
for arg in lin_op.args:
eval_args.append(mul(arg, val_dict, is_abs))
if is_abs:
return op_abs_mul(lin_op, eval_args)
else:
return op_mul(lin_op, eval_args)
def tmul(lin_op, value, is_abs=False):
"""Multiply the transpose of the expression tree by a vector.
Parameters
----------
lin_op : LinOp
The root of an expression tree.
value : NumPy matrix
The vector to multiply by.
is_abs : bool, optional
Multiply by the absolute value of the matrix?
Returns
-------
dict
A map of variable id to value.
"""
# Store the value as the variable.
if lin_op.type is lo.VARIABLE:
return {lin_op.data: value}
# Do nothing for NO_OP.
elif lin_op.type is lo.NO_OP:
return {}
else:
if is_abs:
result = op_abs_tmul(lin_op, value)
else:
result = op_tmul(lin_op, value)
result_dicts = []
for arg in lin_op.args:
result_dicts.append(tmul(arg, result, is_abs))
# Sum repeated ids.
return sum_dicts(result_dicts)
def sum_dicts(dicts):
"""Sums the dictionaries entrywise.
Parameters
----------
dicts : list
A list of dictionaries with numeric entries.
Returns
-------
dict
A dict with the sum.
"""
# Sum repeated entries.
sum_dict = {}
for val_dict in dicts:
for id_, value in val_dict.items():
if id_ in sum_dict:
sum_dict[id_] = sum_dict[id_] + value
else:
sum_dict[id_] = value
return sum_dict
def op_mul(lin_op, args):
"""Applies the linear operator to the arguments.
Parameters
----------
lin_op : LinOp
A linear operator.
args : list
The arguments to the operator.
Returns
-------
NumPy matrix or SciPy sparse matrix.
The result of applying the linear operator.
"""
# Constants convert directly to their value.
if lin_op.type in [lo.SCALAR_CONST, lo.DENSE_CONST, lo.SPARSE_CONST]:
result = lin_op.data
# No-op is not evaluated.
elif lin_op.type is lo.NO_OP:
return None
# For non-leaves, recurse on args.
elif lin_op.type is lo.SUM:
result = sum(args)
elif lin_op.type is lo.NEG:
result = -args[0]
elif lin_op.type is lo.MUL:
coeff = mul(lin_op.data, {})
result = coeff*args[0]
elif lin_op.type is lo.DIV:
divisor = mul(lin_op.data, {})
result = args[0]/divisor
elif lin_op.type is lo.SUM_ENTRIES:
result = np.sum(args[0])
elif lin_op.type is lo.INDEX:
row_slc, col_slc = lin_op.data
result = args[0][row_slc, col_slc]
elif lin_op.type is lo.TRANSPOSE:
result = args[0].T
elif lin_op.type is lo.CONV:
result = conv_mul(lin_op, args[0])
elif lin_op.type is lo.PROMOTE:
result = np.ones(lin_op.shape)*args[0]
elif lin_op.type is lo.DIAG_VEC:
val = intf.from_2D_to_1D(args[0])
result = np.diag(val)
else:
raise Exception("Unknown linear operator.")
return result
def op_abs_mul(lin_op, args):
"""Applies the absolute value of the linear operator to the arguments.
Parameters
----------
lin_op : LinOp
A linear operator.
args : list
The arguments to the operator.
Returns
-------
NumPy matrix or SciPy sparse matrix.
The result of applying the linear operator.
"""
# Constants convert directly to their absolute value.
if lin_op.type in [lo.SCALAR_CONST, lo.DENSE_CONST, lo.SPARSE_CONST]:
result = np.abs(lin_op.data)
elif lin_op.type is lo.NEG:
result = args[0]
# Absolute value of coefficient.
elif lin_op.type is lo.MUL:
coeff = mul(lin_op.data, {}, True)
result = coeff*args[0]
elif lin_op.type is lo.DIV:
divisor = mul(lin_op.data, {}, True)
result = args[0]/divisor
elif lin_op.type is lo.CONV:
result = conv_mul(lin_op, args[0], is_abs=True)
else:
result = op_mul(lin_op, args)
return result
def op_tmul(lin_op, value):
"""Applies the transpose of the linear operator to the arguments.
Parameters
----------
lin_op : LinOp
A linear operator.
value : NumPy matrix
A numeric value to apply the operator's transpose to.
Returns
-------
NumPy matrix or SciPy sparse matrix.
The result of applying the linear operator.
"""
if lin_op.type is lo.SUM:
result = value
elif lin_op.type is lo.NEG:
result = -value
elif lin_op.type is lo.MUL:
coeff = mul(lin_op.data, {})
# Scalar coefficient, no need to transpose.
if np.isscalar(coeff):
result = coeff*value
else:
result = coeff.T*value
elif lin_op.type is lo.DIV:
divisor = mul(lin_op.data, {})
result = value/divisor
elif lin_op.type is lo.SUM_ENTRIES:
result = np.mat(np.ones(lin_op.args[0].shape))*value
elif lin_op.type is lo.INDEX:
row_slc, col_slc = lin_op.data
result = np.mat(np.zeros(lin_op.args[0].shape))
result[row_slc, col_slc] = value
elif lin_op.type is lo.TRANSPOSE:
result = value.T
elif lin_op.type is lo.PROMOTE:
result = np.ones(lin_op.shape[0]).dot(value)
elif lin_op.type is lo.DIAG_VEC:
# The return type in numpy versions < 1.10 was ndarray.
result = np.diag(value)
if isinstance(result, np.matrix):
result = result.A[0]
elif lin_op.type is lo.CONV:
result = conv_mul(lin_op, value, transpose=True)
else:
raise Exception("Unknown linear operator.")
return result
def op_abs_tmul(lin_op, value):
"""Applies the linear operator |A.T| to the arguments.
Parameters
----------
lin_op : LinOp
A linear operator.
value : NumPy matrix
A numeric value to apply the operator's transpose to.
Returns
-------
NumPy matrix or SciPy sparse matrix.
The result of applying the linear operator.
"""
if lin_op.type is lo.NEG:
result = value
# Absolute value of coefficient.
elif lin_op.type is lo.MUL:
coeff = mul(lin_op.data, {}, True)
# Scalar coefficient, no need to transpose.
if np.isscalar(coeff):
result = coeff*value
else:
result = coeff.T*value
elif lin_op.type is lo.DIV:
divisor = mul(lin_op.data, {}, True)
result = value/divisor
elif lin_op.type is lo.CONV:
result = conv_mul(lin_op, value, True, True)
else:
result = op_tmul(lin_op, value)
return result
def conv_mul(lin_op, rh_val, transpose=False, is_abs=False):
"""Multiply by a convolution operator.
arameters
----------
lin_op : LinOp
The root linear operator.
rh_val : NDArray
The vector being convolved.
transpose : bool
Is the transpose of convolution being applied?
is_abs : bool
Is the absolute value of convolution being applied?
Returns
-------
NumPy NDArray
The convolution.
"""
constant = mul(lin_op.data, {}, is_abs)
# Convert to 2D
constant, rh_val = map(intf.from_1D_to_2D, [constant, rh_val])
if transpose:
constant = np.flipud(constant)
# rh_val always larger than constant.
return fftconvolve(rh_val, constant, mode='valid')
else:
# First argument must be larger.
if constant.size >= rh_val.size:
return fftconvolve(constant, rh_val, mode='full')
else:
return fftconvolve(rh_val, constant, mode='full')
def get_constant(lin_op):
"""Returns the constant term in the expression.
Parameters
----------
lin_op : LinOp
The root linear operator.
Returns
-------
NumPy NDArray
The constant term as a flattened vector.
"""
constant = mul(lin_op, {})
const_size = constant.shape[0]*constant.shape[1]
return np.reshape(constant, const_size, 'F')
def get_constr_constant(constraints):
"""Returns the constant term for the constraints matrix.
Parameters
----------
constraints : list
The constraints that form the matrix.
Returns
-------
NumPy NDArray
The constant term as a flattened vector.
"""
# TODO what if constraints is empty?
constants = [get_constant(c.expr) for c in constraints]
return np.hstack(constants)
def prune_constants(constraints):
"""Returns a new list of constraints with constant terms removed.
Parameters
----------
constraints : list
The constraints that form the matrix.
Returns
-------
list
The pruned constraints.
"""
pruned_constraints = []
for constr in constraints:
constr_type = type(constr)
expr = copy.deepcopy(constr.expr)
is_constant = prune_expr(expr)
# Replace a constant root with a NO_OP.
if is_constant:
expr = lo.LinOp(lo.NO_OP, expr.shape, [], None)
pruned = constr_type(expr, constr.constr_id, constr.shape)
pruned_constraints.append(pruned)
return pruned_constraints
def prune_expr(lin_op):
"""Prunes constant branches from the expression.
Parameters
----------
lin_op : LinOp
The root linear operator.
Returns
-------
bool
Were all the expression's arguments pruned?
"""
if lin_op.type is lo.VARIABLE:
return False
elif lin_op.type in [lo.SCALAR_CONST,
lo.DENSE_CONST,
lo.SPARSE_CONST,
lo.PARAM]:
return True
pruned_args = []
is_constant = True
for arg in lin_op.args:
arg_constant = prune_expr(arg)
if not arg_constant:
is_constant = False
pruned_args.append(arg)
# Overwrite old args with only non-constant args.
lin_op.args[:] = pruned_args[:]
return is_constant