/
problems.jl
136 lines (122 loc) · 5.13 KB
/
problems.jl
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
export Problem, Solution, minimize, maximize, satisfy, add_constraint!, add_constraints!
export Float64OrNothing
export conic_problem
Float64OrNothing = Union(Float64, Nothing)
# TODO: Cleanup
type Solution{T<:Number}
primal::Array{T, 1}
dual::Array{T, 1}
slack::Array{T, 1}
status::Symbol
optval::T
has_dual::Bool
end
Solution{T}(x::Array{T, 1}, status::Symbol, optval::T) = Solution(x, T[], T[], status, optval, false)
Solution{T}(x::Array{T, 1}, y::Array{T, 1}, z::Array{T, 1}, status::Symbol, optval::T) = Solution(x, y, z, status, optval, true)
type Problem
head::Symbol
objective::AbstractExpr
constraints::Array{Constraint}
status::Symbol
optval::Float64OrNothing
solution::Solution
function Problem(head::Symbol, objective::AbstractExpr, constraints::Array=Constraint[])
return new(head, objective, constraints, "not yet solved", nothing)
end
end
# If the problem constructed is of the form Ax=b where A is m x n
# returns:
# index: n
# constr_size: m
# var_to_ranges a dictionary mapping from variable id to (start_index, end_index)
# where start_index and end_index are the start and end indexes of the variable in A
function find_variable_ranges(constraints)
index = 0
constr_size = 0
var_to_ranges = Dict{Uint64, (Int64, Int64)}()
for constraint in constraints
for i = 1:length(constraint.objs)
for (id, val) in constraint.objs[i]
if !haskey(var_to_ranges, id) && id != object_id(:constant)
var = id_to_variables[id]
var_to_ranges[id] = (index + 1, index + get_vectorized_size(var))
index += get_vectorized_size(var)
end
end
constr_size += constraint.sizes[i]
end
end
return index, constr_size, var_to_ranges
end
function conic_form!(p::Problem, unique_conic_forms::UniqueConicForms)
objective_var = Variable()
objective = conic_form!(objective_var, unique_conic_forms)
conic_form!(p.objective - objective_var == 0, unique_conic_forms)
for constraint in p.constraints
conic_form!(constraint, unique_conic_forms)
end
return objective, objective_var.id_hash
end
function conic_problem(p::Problem)
# A map to hold unique constraints. Each constraint is keyed by a symbol
# of which atom generated the constraints, and a integer hash of the child
# expressions used by the atom
unique_conic_forms = UniqueConicForms()
objective, objective_var_id = conic_form!(p, unique_conic_forms)
constraints = unique_conic_forms.constr_list
var_size, constr_size, var_to_ranges = find_variable_ranges(constraints)
c = spzeros(var_size, 1)
objective_range = var_to_ranges[objective_var_id]
c[objective_range[1]:objective_range[2]] = 1
A = spzeros(constr_size, var_size)
b = spzeros(constr_size, 1)
cones = (Symbol, UnitRange{Int64})[]
constr_index = 0
for constraint in constraints
total_constraint_size = 0
for i = 1:length(constraint.objs)
sz = constraint.sizes[i]
for (id, val) in constraint.objs[i]
if id == object_id(:constant)
b[constr_index + 1 : constr_index + sz] = val
else
var_range = var_to_ranges[id]
A[constr_index + 1 : constr_index + sz, var_range[1] : var_range[2]] = -val
end
end
constr_index += sz
total_constraint_size += sz
end
push!(cones, (constraint.cone, constr_index - total_constraint_size + 1 : constr_index))
end
return c, A, b, cones, var_to_ranges
end
Problem(head::Symbol, objective::AbstractExpr, constraints::Constraint...) =
Problem(head, objective, [constraints...])
# Allow users to simply type minimize
minimize(objective::AbstractExpr, constraints::Constraint...) =
Problem(:minimize, objective, [constraints...])
minimize{T<:Constraint}(objective::AbstractExpr, constraints::Array{T}=Constraint[]) =
Problem(:minimize, objective, constraints)
minimize(objective::Value, constraints::Constraint...) =
minimize(convert(AbstractExpr, objective), constraints)
minimize{T<:Constraint}(objective::Value, constraints::Array{T}=Constraint[]) =
minimize(convert(AbstractExpr, objective), constraints)
# Allow users to simply type maximize
maximize(objective::AbstractExpr, constraints::Constraint...) =
Problem(:maximize, objective, [constraints...])
maximize{T<:Constraint}(objective::AbstractExpr, constraints::Array{T}=Constraint[]) =
Problem(:maximize, objective, constraints)
maximize(objective::Value, constraints::Constraint...) =
maximize(convert(AbstractExpr, objective), constraints)
maximize{T<:Constraint}(objective::Value, constraints::Array{T}=Constraint[]) =
maximize(convert(AbstractExpr, objective), constraints)
# Allow users to simply type satisfy (if there is no objective)
satisfy(constraints::Constraint...) = Problem(:minimize, Constant(0), [constraints...])
satisfy{T<:Constraint}(constraints::Array{T}=Constraint[]) =
Problem(:minimize, Constant(0), constraints)
satisfy(constraint::Constraint) = satisfy([constraint])
# +(constraints, constraints) is defined in constraints.jl
add_constraints!{T<:Constraint}(p::Problem, constraints::Array{T}) = +(p.constraints, constraints)
add_constraints!(p::Problem, constraint::Constraint) = add_constraints!(p, [constraint])
add_constraint! = add_constraints!