Closed dlcole3 closed 2 years ago
Merging #23 (41976f0) into main (2fb4f31) will increase coverage by
2.27%
. The diff coverage is99.41%
.
@@ Coverage Diff @@
## main #23 +/- ##
==========================================
+ Coverage 94.05% 96.32% +2.27%
==========================================
Files 1 1
Lines 353 599 +246
==========================================
+ Hits 332 577 +245
- Misses 21 22 +1
Impacted Files | Coverage Δ | |
---|---|---|
src/DynamicNLPModels.jl | 96.32% <99.41%> (+2.27%) |
:arrow_up: |
Continue to review full report at Codecov.
Legend - Click here to learn more
Δ = absolute <relative> (impact)
,ø = not affected
,? = missing data
Powered by Codecov. Last update 2fb4f31...41976f0. Read the comment docs.
Looks good @dlcole3
Added both sparse and condensed support for
K
state elimination.LQDynamicData
with new type forK::MK
. This allows for multiple dispatch of different functions._build_condensed_lq_dynamic_model
and_build_sparse_lq_dynamic_model
for different types ofK
. The matrixK
influences problem type and constraint and variable bounds.A
andE
matrices within_build_sparse_lq_dynamic_model
for whenK
is defined._build_sparse_J3
function that is called within the_build_sparse_lq_dynamic_model
whenK <: AbstractMatrix
. This converts $u$ variable bounds to algebraic constriants for $v$_build_condensed_blocks
to just build the block matrices of the condensed problems_build_condensed_H_blocks
that returnsH
,h
, andh0
. Defined two forms of the function depending onK
type_build_condensed_G_blocks
that returnsJ
,lcon
, anducon
.sparse_lq_test.jl
to include aK
matrixruntests.jl
to test the problem with aK
matrix, with aK
matrix andS
matrix, with aK
matrix andS
matrix and partial bounds on $u$, and with theK
matrix and no bounds.