forked from cvxpy/cvxpy
-
Notifications
You must be signed in to change notification settings - Fork 2
/
ex_5_33.py
82 lines (66 loc) · 2.21 KB
/
ex_5_33.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
"""
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.
"""
from __future__ import division
from multiprocessing import Pool
import cvxopt
import numpy as np
from pylab import plot, show, title, xlabel, ylabel
from cvxpy import Minimize, Parameter, Problem, Variable, norm
# Taken from CVX website http://cvxr.com/cvx/examples/
# Exercise 5.33: Parametrized l1-norm approximation
# Ported from cvx matlab to cvxpy by Misrab Faizullah-Khan
# Original comments below
# Boyd & Vandenberghe "Convex Optimization"
# Joelle Skaf - 08/29/05
# (a figure is generated)
#
# Let p_star(epsilon) be the optimal value of the following problem:
# minimize ||Ax + b + epsilon*d||_1
# Plots p_star(epsilon) versus epsilon and demonstrates the fact that it's
# affine on an interval that includes epsilon = 0.
# Input data
m = 6
n = 3
A = cvxopt.matrix([ -2, 7, 1,
-5, -1, 3,
-7, 3, -5,
-1, 4, -4,
1, 5, 5,
2, -5, -1 ], (m,n))
b = cvxopt.matrix([-4, 3, 9, 0, -11, 5], (m,1))
d = cvxopt.matrix([-10, -13, -27, -10, -7, 14], (m,1))
epsilon = Parameter()
# The problem
x = Variable(n)
objective = Minimize( norm( A*x + b + epsilon*d , 1 ) )
p = Problem(objective, [])
# Assign a value to gamma and find the optimal x
def get_p(e_value):
epsilon.value = e_value
result = p.solve()
return result
# Range of epsilon values
e_values = np.linspace(-1,1,41)
# Solve serially if desired
# x_values = [get_p(value) for value in e_values]
# Solve in parallel
print('Computing p*(epsilon) for -1 <= epsilon <= 1 ...')
pool = Pool(processes = 4)
p_values = pool.map(get_p, e_values)
print('Done!')
# Plots
plot(e_values, p_values)
title(r'p*($\epsilon$) vs $\epsilon$')
xlabel(r'$\epsilon$')
ylabel(r'p*($\epsilon$)')
show()