R Under development (unstable) (2026-02-27 r89498 ucrt) -- "Unsuffered Consequences" Copyright (C) 2026 The R Foundation for Statistical Computing Platform: x86_64-w64-mingw32/x64 R is free software and comes with ABSOLUTELY NO WARRANTY. You are welcome to redistribute it under certain conditions. Type 'license()' or 'licence()' for distribution details. R is a collaborative project with many contributors. Type 'contributors()' for more information and 'citation()' on how to cite R or R packages in publications. Type 'demo()' for some demos, 'help()' for on-line help, or 'help.start()' for an HTML browser interface to help. Type 'q()' to quit R. > library(testthat) > library(osqp) > > test_check("osqp") ----------------------------------------------------------------- OSQP v1.0.0 - Operator Splitting QP Solver (c) The OSQP Developer Team ----------------------------------------------------------------- problem: variables n = 3, constraints m = 5 nnz(P) + nnz(A) = 15 settings: algebra = Built-in, OSQPInt = 4 bytes, OSQPFloat = 8 bytes, linear system solver = QDLDL v0.1.8, eps_abs = 1.0e-03, eps_rel = 1.0e-03, eps_prim_inf = 1.0e-04, eps_dual_inf = 1.0e-04, rho = 1.00e-01 (adaptive: 50 iterations), sigma = 1.00e-06, alpha = 1.60, max_iter = 4000 check_termination: on (interval 25, duality gap: on), time_limit: 1.00e-10 sec, scaling: on (10 iterations), scaled_termination: off warm starting: on, polishing: off, iter objective prim res dual res gap rel kkt rho time run time limit reached 0 0.0000e+00 1.80e+01 3.44e+02 -3.43e+02 3.44e+02 1.00e-01 1.03e-04s status: run time limit reached number of iterations: 0 run time: 1.84e-04s optimal rho estimate: 1.00e-01 ----------------------------------------------------------------- OSQP v1.0.0 - Operator Splitting QP Solver (c) The OSQP Developer Team ----------------------------------------------------------------- problem: variables n = 2, constraints m = 5 nnz(P) + nnz(A) = 11 settings: algebra = Built-in, OSQPInt = 4 bytes, OSQPFloat = 8 bytes, linear system solver = QDLDL v0.1.8, eps_abs = 1.0e-03, eps_rel = 1.0e-03, eps_prim_inf = 1.0e-04, eps_dual_inf = 1.0e-04, rho = 1.00e-01 (adaptive: 50 iterations), sigma = 1.00e-06, alpha = 1.60, max_iter = 4000 check_termination: on (interval 25, duality gap: on), time_limit: 1.00e+10 sec, scaling: on (10 iterations), scaled_termination: off warm starting: on, polishing: off, iter objective prim res dual res gap rel kkt rho time 1 -4.5938e+00 1.92e+01 4.37e+00 -3.22e+01 1.92e+01 1.00e-01 6.62e-05s 50 3.2497e+01 2.33e-04 1.78e-05 -2.76e-03 2.33e-04 1.00e-01 1.44e-04s status: solved number of iterations: 50 optimal objective: 32.4973 dual objective: 32.5001 duality gap: -2.7585e-03 primal-dual integral: 3.2467e+01 run time: 2.11e-04s optimal rho estimate: 5.83e-01 ----------------------------------------------------------------- OSQP v1.0.0 - Operator Splitting QP Solver (c) The OSQP Developer Team ----------------------------------------------------------------- problem: variables n = 2, constraints m = 5 nnz(P) + nnz(A) = 11 settings: algebra = Built-in, OSQPInt = 4 bytes, OSQPFloat = 8 bytes, linear system solver = QDLDL v0.1.8, eps_abs = 1.0e-03, eps_rel = 1.0e-03, eps_prim_inf = 1.0e-04, eps_dual_inf = 1.0e-04, rho = 1.00e-01 (adaptive: 50 iterations), sigma = 1.00e-06, alpha = 1.60, max_iter = 4000 check_termination: on (interval 25, duality gap: on), time_limit: 1.00e+10 sec, scaling: on (10 iterations), scaled_termination: off warm starting: on, polishing: off, iter objective prim res dual res gap rel kkt rho time 1 -4.5938e+00 1.92e+01 4.37e+00 -3.22e+01 1.92e+01 1.00e-01 3.89e-05s 50 3.2497e+01 2.33e-04 1.78e-05 -2.76e-03 2.33e-04 1.00e-01 8.80e-05s status: solved number of iterations: 50 optimal objective: 32.4973 dual objective: 32.5001 duality gap: -2.7585e-03 primal-dual integral: 3.2467e+01 run time: 1.30e-04s optimal rho estimate: 5.83e-01 ----------------------------------------------------------------- OSQP v1.0.0 - Operator Splitting QP Solver (c) The OSQP Developer Team ----------------------------------------------------------------- problem: variables n = 2, constraints m = 5 nnz(P) + nnz(A) = 10 settings: algebra = Built-in, OSQPInt = 4 bytes, OSQPFloat = 8 bytes, linear system solver = QDLDL v0.1.8, eps_abs = 1.0e-09, eps_rel = 1.0e-09, eps_prim_inf = 1.0e-04, eps_dual_inf = 1.0e-04, rho = 1.00e-01 (adaptive: 50 iterations), sigma = 1.00e-06, alpha = 1.60, max_iter = 4000 check_termination: on (interval 25, duality gap: on), time_limit: 1.00e+10 sec, scaling: on (10 iterations), scaled_termination: off warm starting: on, polishing: off, iter objective prim res dual res gap rel kkt rho time 1 -7.2491e+00 2.04e+01 3.59e+00 -3.73e+01 2.04e+01 1.00e-01 5.03e-05s 200 2.0000e+01 2.15e-07 9.82e-08 -7.78e-07 2.15e-07 1.00e-01 1.32e-04s 250 2.0000e+01 3.35e-09 7.35e-10 -7.96e-10 3.35e-09 1.00e-01 1.80e-04s status: solved number of iterations: 250 optimal objective: 20.0001 dual objective: 20.0001 duality gap: -7.9553e-10 primal-dual integral: 4.1060e+01 run time: 2.21e-04s optimal rho estimate: 1.10e-01 iter objective prim res dual res gap rel kkt rho time 1 1.4646e+01 9.66e+00 2.61e+00 -1.74e+01 9.66e+00 1.00e-01 3.02e-05s 50 5.3333e+01 6.15e-11 4.86e-11 9.73e-11 9.73e-11 1.00e-01 8.25e-05s status: solved number of iterations: 50 optimal objective: 53.3333 dual objective: 53.3333 duality gap: 9.7269e-11 primal-dual integral: 5.8498e+01 run time: 1.23e-04s optimal rho estimate: 9.30e-02 [ FAIL 0 | WARN 0 | SKIP 0 | PASS 57 ] > > proc.time() user system elapsed 2.84 0.46 3.29