-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathzero_polynomial_in_algebraic_set.jl
More file actions
138 lines (126 loc) · 4.38 KB
/
Copy pathzero_polynomial_in_algebraic_set.jl
File metadata and controls
138 lines (126 loc) · 4.38 KB
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
using LinearAlgebra
struct ZeroPolynomialInAlgebraicSetBridge{
T,
F<:MOI.AbstractVectorFunction,
Z<:SA.AbstractBasis,
DT<:SS.AbstractAlgebraicSet,
B<:MB.SubBasis,
} <: MOI.Bridges.Constraint.AbstractBridge
zero_constraint::MOI.ConstraintIndex{
F,
PolyJuMP.ZeroPolynomialSet{SS.FullSpace,Z,B},
}
domain::DT
basis::B
end
function MOI.Bridges.Constraint.bridge_constraint(
::Type{ZeroPolynomialInAlgebraicSetBridge{T,F,Z,DT,B}},
model::MOI.ModelLike,
f::MOI.AbstractVectorFunction,
s::PolyJuMP.ZeroPolynomialSet{<:SS.AbstractAlgebraicSet,Z,B},
) where {T,F,Z,DT,B}
p = MP.polynomial(MB.algebra_element(MOI.Utilities.scalarize(f), s.basis))
# As `*(::MOI.ScalarAffineFunction{T}, ::S)` is only defined if `S == T`, we
# need to call `similar`. This is critical since `T` is
# `Float64` when used with JuMP and the coefficient type is often `Int` with
# `FixedVariablesSet`.
# FIXME convert needed because the coefficient type of `r` is `Any` otherwise if `domain` is `AlgebraicSet`
r = convert(typeof(p), rem(p, SS.ideal(similar(s.domain, T))))
zero_constraint = MOI.add_constraint(
model,
MOI.Utilities.vectorize(MP.coefficients(r)),
PolyJuMP.ZeroPolynomialSet(
SS.FullSpace(),
s.zero_basis,
MB.SubBasis{MB.Monomial}(MP.monomials(r)),
),
)
return ZeroPolynomialInAlgebraicSetBridge{T,F,Z,DT,B}(
zero_constraint,
s.domain,
s.basis,
)
end
function MOI.supports_constraint(
::Type{ZeroPolynomialInAlgebraicSetBridge{T}},
::Type{<:MOI.AbstractVectorFunction},
::Type{<:PolyJuMP.ZeroPolynomialSet{<:SS.AbstractAlgebraicSet}},
) where {T}
return true
end
function MOI.Bridges.added_constrained_variable_types(
::Type{<:ZeroPolynomialInAlgebraicSetBridge},
)
return Tuple{Type}[]
end
function MOI.Bridges.added_constraint_types(
::Type{<:ZeroPolynomialInAlgebraicSetBridge{T,F,Z,DT,B}},
) where {T,F,Z,DT,B}
return [(F, PolyJuMP.ZeroPolynomialSet{SS.FullSpace,Z,B})]
end
function MOI.Bridges.Constraint.concrete_bridge_type(
::Type{<:ZeroPolynomialInAlgebraicSetBridge{T}},
F::Type{<:MOI.AbstractVectorFunction},
::Type{<:PolyJuMP.ZeroPolynomialSet{DT,Z,B}},
) where {T,Z,DT<:SS.AbstractAlgebraicSet,B}
G = MOI.Utilities.promote_operation(-, T, F, F)
return ZeroPolynomialInAlgebraicSetBridge{T,G,Z,DT,B}
end
# Attributes, Bridge acting as an model
function MOI.get(
::ZeroPolynomialInAlgebraicSetBridge{T,F,Z,DT,B},
::MOI.NumberOfConstraints{F,PolyJuMP.ZeroPolynomialSet{SS.FullSpace,Z,B}},
) where {T,F,Z,DT,B}
return 1
end
function MOI.get(
b::ZeroPolynomialInAlgebraicSetBridge{T,F,Z,DT,B},
::MOI.ListOfConstraintIndices{
F,
PolyJuMP.ZeroPolynomialSet{SS.FullSpace,Z,B},
},
) where {T,F,Z,DT,B}
return [b.zero_constraint]
end
# Indices
function MOI.delete(model::MOI.ModelLike, c::ZeroPolynomialInAlgebraicSetBridge)
return MOI.delete(model, c.zero_constraint)
end
# Attributes, Bridge acting as a constraint
function MOI.get(
model::MOI.ModelLike,
attr::MOI.ConstraintSet,
bridge::ZeroPolynomialInAlgebraicSetBridge,
)
set = MOI.get(model, attr, bridge.zero_constraint)
return PolyJuMP.ZeroPolynomialSet(
bridge.domain,
set.zero_basis,
bridge.basis,
)
end
# TODO ConstraintPrimal
# Let A be the linear map corresponding to A(p) = rem(p, ideal(set.domain))
# We want to compute A*(μ) (where A* is the conjugate of A); see
# slide 9 of https://www.youtube.com/watch?v=C8dHxJCUHYw.
# That is, for every monomial of the basis `mono`, we want to compute
# `⟨mono, A*(μ)⟩`. By definition of the conjugacy, we have `⟨mono, A*(μ)⟩ = ⟨A(mono), μ⟩`
# so we can compute compute it by `⟨rem(mono, ideal(set.domain)), μ⟩`
function MOI.get(
model::MOI.ModelLike,
attr::MOI.ConstraintDual,
bridge::ZeroPolynomialInAlgebraicSetBridge,
)
dual = MOI.get(model, attr, bridge.zero_constraint)
set = MOI.get(model, MOI.ConstraintSet(), bridge.zero_constraint)
μ = MM.measure(dual, set.basis)
I = SS.ideal(bridge.domain)
return [dot(rem(mono, I), μ) for mono in MB.keys_as_monomials(bridge.basis)]
end
function MOI.get(
model::MOI.ModelLike,
attr::PolyJuMP.MomentsAttribute,
bridge::ZeroPolynomialInAlgebraicSetBridge,
)
return MOI.get(model, attr, bridge.zero_constraint)
end