up compat solvercore 0.3 (#109)

Author: geoffroyleconte

Project.toml

@@ -18,7 +18,7 @@ LinearOperators = "2.2.2, 2.3"
 NLPModels = "0.18, 0.19"
 NLPModelsModifiers = "0.6"
 Requires = "0.3, 0.4, 0.5, 1.0"
-SolverCore = "0.2.2"
+SolverCore = "0.3"
 SparseMatricesCOO = "0.1.1, 0.2"
 julia = "^1.0.0"
 

src/presolve/presolve.jl

@@ -301,17 +301,17 @@ function presolve(
 
   if qmp.unbounded
     return GenericExecutionStats(
-      :unbounded,
       qm,
+      status = :unbounded,
       solution = qmp.xps,
       iter = 0,
       elapsed_time = time() - start_time,
       solver_specific = Dict(:presolvedQM => nothing),
     )
   elseif infeasible
     return GenericExecutionStats(
-      :infeasible,
       qm,
+      status = :infeasible,
       solution = qmp.xps,
       iter = 0,
       elapsed_time = time() - start_time,
@@ -321,8 +321,8 @@ function presolve(
     feasible = all(qm.meta.lcon .<= qm.data.A * qmp.xps .<= qm.meta.ucon)
     s = qm.data.c .+ Symmetric(qm.data.H, :L) * qmp.xps
     return GenericExecutionStats(
-      feasible ? :first_order : :infeasible,
       qm,
+      status = feasible ? :first_order : :infeasible,
       solution = qmp.xps,
       objective = obj(qm, qmp.xps),
       multipliers = zeros(T, ncon),
@@ -364,8 +364,8 @@ function presolve(
     )
     ps = PresolvedQuadraticModel(psmeta, Counters(), psdata, psd)
     return GenericExecutionStats(
-      :unknown,
       ps,
+      status = :unknown,
       iter = 0,
       elapsed_time = time() - start_time,
       solver_specific = Dict(:presolvedQM => ps, :psoperations => operations),