R Under development (unstable) (2026-06-11 r90128) -- "Unsuffered Consequences" Copyright (C) 2026 The R Foundation for Statistical Computing Platform: x86_64-pc-linux-gnu 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. > if (requireNamespace("tinytest", quietly = TRUE)) { + tinytest::test_package("Uno") + } test_uno_solve.R.............. 1 tests OK test_uno_solve.R.............. 1 tests OK test_uno_solve.R.............. 1 tests OK test_uno_solve.R.............. 1 tests OK test_uno_solve.R.............. 1 tests OK test_uno_solve.R.............. 1 tests OK Original model C model 2 variables, 1 constraints (0 equality, 1 inequality) Problem type: NLP Non-default options: QP_solver = HiGHS ────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Radius Phase ||Step|| Objective Infeas Statio Compl Status ────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - 1.00e+01 OPT - 5.000e+00 0.00e+00 4.47e+00 0.00e+00 initial point 1 1 - 1.00e+01 OPT 2.00e+00 1.250e-14 0.00e+00 2.24e-07 0.00e+00 ✔ (f-type) ────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Radius Phase ||Step|| Objective Infeas Statio Compl Status ────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (TR Fletcher-filter restoration inequality-constrained SQP method with exact Hessian and no inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 1.25e-14 Primal feasibility: 0 ┌ Stationarity residual: 2.236068e-07 │ Primal feasibility: 0 └ Complementarity residual: 0 CPU time: 0.112582s Iterations: 1 Objective evaluations: 2 Constraints evaluations: 2 Objective gradient evaluations: 2 Jacobian evaluations: 2 Hessian evaluations: 1 Number of subproblems solved: 1 test_uno_solve.R.............. 1 tests OK test_uno_solve.R.............. 2 tests OK test_uno_solve.R.............. 3 tests OK test_uno_solve.R.............. 4 tests OK test_uno_solve.R.............. 5 tests OK test_uno_solve.R.............. 6 tests OK test_uno_solve.R.............. 7 tests OK test_uno_solve.R.............. 7 tests OK Original model C model 2 variables, 1 constraints (0 equality, 1 inequality) Problem type: NLP Error in (function (x) : boom An error occurred at the initial iterate: A numerical error was encountered while evaluating a function ───────────────────────────────────────────────────────────────────────── Iterations Major ||Step|| Objective Infeas Statio Compl Status ───────────────────────────────────────────────────────────────────────── Error in (function (x) : boom The objective could not be evaluated at the final iterate: A numerical error was encountered while evaluating a function Uno 2.7.3 (strategy combination not initialized) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Evaluation error Solution status: Suboptimal point Objective value: inf Primal feasibility: 0 ┌ Stationarity residual: inf │ Primal feasibility: 0 └ Complementarity residual: inf CPU time: 0.004925s Iterations: 0 Objective evaluations: 0 Constraints evaluations: 1 Objective gradient evaluations: 0 Jacobian evaluations: 0 Hessian evaluations: 0 Number of subproblems solved: 0 test_uno_solve.R.............. 7 tests OK test_uno_solve.R.............. 8 tests OK test_uno_solve.R.............. 8 tests OK Original model C model 2 variables, 1 constraints (0 equality, 1 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 3 variables, 1 constraints (1 equality, 0 inequality) Non-default options: linear_solver = MUMPS ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - OPT - - 5.000e+00 0.00e+00 4.00e+00 1.00e+01 initial point 1 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.72e+00 3.971e-02 0.00e+00 1.00e-06 2.05e+00 ✔ (f-type) 2 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.58e-01 2.813e-04 4.44e-16 1.00e-06 1.67e-01 ✔ (f-type) 3 1 - 2.83e-03 1.00e+00 OPT 0.00e+00 2.32e-02 1.158e-07 4.44e-16 2.83e-08 3.37e-03 ✔ (f-type) 4 1 - 1.50e-04 1.00e+00 OPT 0.00e+00 4.60e-04 2.315e-10 0.00e+00 1.50e-09 1.51e-04 ✔ (f-type) 5 1 - 1.84e-06 1.00e+00 OPT 0.00e+00 2.13e-05 3.474e-14 0.00e+00 1.84e-11 1.85e-06 ✔ (f-type) 6 1 - 2.51e-09 1.00e+00 OPT 0.00e+00 2.63e-07 6.407e-20 0.00e+00 2.51e-14 2.51e-09 ✔ (f-type) ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS Waechter-filter restoration primal-dual interior-point method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 6.407161e-20 Primal feasibility: 0 ┌ Stationarity residual: 2.505904e-14 │ Primal feasibility: 0 └ Complementarity residual: 2.505973e-09 CPU time: 0.013877s Iterations: 6 Objective evaluations: 7 Constraints evaluations: 8 Objective gradient evaluations: 7 Jacobian evaluations: 7 Hessian evaluations: 6 Number of subproblems solved: 6 test_uno_solve.R.............. 8 tests OK test_uno_solve.R.............. 9 tests OK test_uno_solve.R.............. 10 tests OK test_uno_solve.R.............. 11 tests OK test_uno_solve.R.............. 12 tests OK test_uno_solve.R.............. 12 tests OK test_uno_solve.R.............. 12 tests OK test_uno_solve.R.............. 12 tests OK test_uno_solve.R.............. 12 tests OK test_uno_solve.R.............. 12 tests OK Original model C model 2 variables, 2 constraints (0 equality, 2 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 4 variables, 2 constraints (2 equality, 0 inequality) Non-default options: linear_solver = MUMPS ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - OPT - - 9.090e+02 4.02e+00 2.40e+03 2.50e+00 initial point 1 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.66e+00 9.006e+02 4.00e+00 2.39e+03 7.72e-01 ✔ (h-type) 2 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 7.534e+02 3.85e+00 2.96e+03 6.82e-01 ✔ (h-type) 3 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 2.338e+01 1.24e+00 4.19e+03 1.26e-01 ✔ (h-type) 4 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.63e+00 1.034e+01 1.54e+00 4.31e+03 8.15e-02 ✔ (h-type) 5 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.30e+00 4.508e+02 5.68e+00 - - ✘ (h-type) - 2 - - 5.00e-01 - - 1.15e+00 8.305e+01 2.19e+00 - - ✘ (h-type) - 3 - - 2.50e-01 - - 5.75e-01 9.160e+00 1.51e+00 9.95e+03 1.26e-01 ✔ (h-type) 6 1 - 1.00e-01 1.00e+00 OPT 1.00e+06 1.13e+00 9.023e+00 1.47e+00 2.06e+04 3.10e-02 ✔ (h-type) 7 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.12e+00 9.028e+00 1.47e+00 2.09e+04 5.63e-02 ✔ (h-type) 8 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 5.14e+00 9.015e+00 1.47e+00 2.07e+04 7.21e-04 ✔ (h-type) 9 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.30e+00 6.964e+00 1.41e+00 2.16e+04 4.26e-03 ✔ (h-type) 10 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.14e+00 6.944e+00 1.40e+00 2.16e+04 4.72e-03 ✔ (h-type) 11 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.09e+00 6.951e+00 1.40e+00 1.00e+05 1.78e-01 ✔ (h-type) 12 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.18e+00 3.065e+02 2.22e+00 - - ✘ (filter) - 2 - - 5.00e-01 - - 1.09e+00 1.011e+02 1.26e+00 5.40e+04 7.81e-01 ✔ (h-type) 13 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.76e+00 3.065e+02 5.56e-01 6.67e+04 1.10e-01 ✔ (h-type) 14 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 5.56e-01 3.065e+02 3.39e-11 2.97e+02 1.10e-01 ✔ (h-type) 15 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.50e-03 3.067e+02 1.68e-07 6.50e-05 1.00e-01 ✔ (f-type) 16 1 - 1.50e-04 1.00e+00 OPT 0.00e+00 1.54e-03 3.065e+02 1.78e-07 1.87e-05 1.85e-04 ✔ (f-type) 17 1 - 1.84e-06 1.00e+00 OPT 0.00e+00 2.95e-06 3.065e+02 7.20e-13 1.07e-10 1.85e-06 ✔ (f-type) 18 1 - 2.51e-09 1.00e+00 OPT 0.00e+00 3.68e-08 3.065e+02 1.11e-16 1.14e-13 2.51e-09 ✔ (f-type) ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS Waechter-filter restoration primal-dual interior-point method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 306.5 Primal feasibility: 1.110223e-16 ┌ Stationarity residual: 1.136868e-13 │ Primal feasibility: 1.110223e-16 └ Complementarity residual: 2.506011e-09 CPU time: 0.034707s Iterations: 18 Objective evaluations: 22 Constraints evaluations: 23 Objective gradient evaluations: 22 Jacobian evaluations: 22 Hessian evaluations: 18 Number of subproblems solved: 18 test_uno_solve.R.............. 12 tests OK test_uno_solve.R.............. 13 tests OK test_uno_solve.R.............. 14 tests OK test_uno_solve.R.............. 15 tests OK test_uno_solve.R.............. 16 tests OK test_uno_solve.R.............. 17 tests OK test_uno_solve.R.............. 18 tests OK test_uno_solve.R.............. 19 tests OK test_uno_solve.R.............. 20 tests OK test_uno_solve.R.............. 21 tests OK test_uno_solve.R.............. 22 tests OK test_uno_solve.R.............. 23 tests OK test_uno_solve.R.............. 24 tests OK test_uno_solve.R.............. 25 tests OK test_uno_solve.R.............. 26 tests OK test_uno_solve.R.............. 27 tests OK test_uno_solve.R.............. 27 tests OK Original model C model 2 variables, 2 constraints (0 equality, 2 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 4 variables, 2 constraints (2 equality, 0 inequality) Non-default options: linear_solver = MUMPS ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - OPT - - 9.090e+02 4.02e+00 2.40e+03 2.50e+00 initial point 1 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.66e+00 9.006e+02 4.00e+00 2.39e+03 7.72e-01 ✔ (h-type) 2 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 7.534e+02 3.85e+00 2.96e+03 6.82e-01 ✔ (h-type) 3 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 2.338e+01 1.24e+00 4.19e+03 1.26e-01 ✔ (h-type) ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS Waechter-filter restoration primal-dual interior-point method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Iteration limit Solution status: Suboptimal point Objective value: 23.37873 Primal feasibility: 1.240584 ┌ Stationarity residual: 4188.689 │ Primal feasibility: 1.240584 └ Complementarity residual: 0.1260652 CPU time: 0.008932s Iterations: 3 Objective evaluations: 4 Constraints evaluations: 5 Objective gradient evaluations: 4 Jacobian evaluations: 4 Hessian evaluations: 3 Number of subproblems solved: 3 test_uno_solve.R.............. 27 tests OK test_uno_solve.R.............. 28 tests OK Original model C model 2 variables, 2 constraints (0 equality, 2 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 4 variables, 2 constraints (2 equality, 0 inequality) Non-default options: linear_solver = MUMPS ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - OPT - - 9.090e+02 4.02e+00 2.40e+03 2.50e+00 initial point 1 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.66e+00 9.006e+02 4.00e+00 2.39e+03 7.72e-01 ✔ (h-type) 2 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 7.534e+02 3.85e+00 2.96e+03 6.82e-01 ✔ (h-type) 3 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 2.338e+01 1.24e+00 4.19e+03 1.26e-01 ✔ (h-type) ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS Waechter-filter restoration primal-dual interior-point method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Iteration limit Solution status: Suboptimal point Objective value: 23.37873 Primal feasibility: 1.240584 ┌ Stationarity residual: 4188.689 │ Primal feasibility: 1.240584 └ Complementarity residual: 0.1260652 CPU time: 0.007929s Iterations: 3 Objective evaluations: 4 Constraints evaluations: 5 Objective gradient evaluations: 4 Jacobian evaluations: 4 Hessian evaluations: 3 Number of subproblems solved: 3 test_uno_solve.R.............. 28 tests OK test_uno_solve.R.............. 29 tests OK test_uno_solve.R.............. 30 tests OK test_uno_solve.R.............. 31 tests OK test_uno_solve.R.............. 31 tests OK Original model C model 2 variables, 2 constraints (0 equality, 2 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 4 variables, 2 constraints (2 equality, 0 inequality) Non-default options: linear_solver = MUMPS ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - OPT - - 9.090e+02 4.02e+00 2.40e+03 2.50e+00 initial point 1 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.66e+00 9.006e+02 4.00e+00 2.39e+03 7.72e-01 ✔ (h-type) 2 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 7.534e+02 3.85e+00 2.96e+03 6.82e-01 ✔ (h-type) 3 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.95e+00 2.338e+01 1.24e+00 4.19e+03 1.26e-01 ✔ (h-type) 4 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.63e+00 1.034e+01 1.54e+00 4.31e+03 8.15e-02 ✔ (h-type) 5 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.30e+00 4.508e+02 5.68e+00 - - ✘ (h-type) - 2 - - 5.00e-01 - - 1.15e+00 8.305e+01 2.19e+00 - - ✘ (h-type) - 3 - - 2.50e-01 - - 5.75e-01 9.160e+00 1.51e+00 9.95e+03 1.26e-01 ✔ (h-type) 6 1 - 1.00e-01 1.00e+00 OPT 1.00e+06 1.13e+00 9.023e+00 1.47e+00 2.06e+04 3.10e-02 ✔ (h-type) 7 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.12e+00 9.028e+00 1.47e+00 2.09e+04 5.63e-02 ✔ (h-type) 8 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 5.14e+00 9.015e+00 1.47e+00 2.07e+04 7.21e-04 ✔ (h-type) 9 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.30e+00 6.964e+00 1.41e+00 2.16e+04 4.26e-03 ✔ (h-type) 10 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.14e+00 6.944e+00 1.40e+00 2.16e+04 4.72e-03 ✔ (h-type) 11 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.09e+00 6.951e+00 1.40e+00 1.00e+05 1.78e-01 ✔ (h-type) 12 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.18e+00 3.065e+02 2.22e+00 - - ✘ (filter) - 2 - - 5.00e-01 - - 1.09e+00 1.011e+02 1.26e+00 5.40e+04 7.81e-01 ✔ (h-type) 13 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 2.76e+00 3.065e+02 5.56e-01 6.67e+04 1.10e-01 ✔ (h-type) 14 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 5.56e-01 3.065e+02 3.39e-11 2.97e+02 1.10e-01 ✔ (h-type) 15 1 - 1.00e-01 1.00e+00 OPT 0.00e+00 1.50e-03 3.067e+02 1.68e-07 6.50e-05 1.00e-01 ✔ (f-type) 16 1 - 1.50e-04 1.00e+00 OPT 0.00e+00 1.54e-03 3.065e+02 1.78e-07 1.87e-05 1.85e-04 ✔ (f-type) 17 1 - 1.84e-06 1.00e+00 OPT 0.00e+00 2.95e-06 3.065e+02 7.20e-13 1.07e-10 1.85e-06 ✔ (f-type) 18 1 - 2.51e-09 1.00e+00 OPT 0.00e+00 3.68e-08 3.065e+02 1.11e-16 1.14e-13 2.51e-09 ✔ (f-type) ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Barrier Steplength Phase Regulariz ||Step|| Objective Infeas Statio Compl Status ─────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS Waechter-filter restoration primal-dual interior-point method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 306.5 Primal feasibility: 1.110223e-16 ┌ Stationarity residual: 1.136868e-13 │ Primal feasibility: 1.110223e-16 └ Complementarity residual: 2.506011e-09 CPU time: 0.035637s Iterations: 18 Objective evaluations: 22 Constraints evaluations: 23 Objective gradient evaluations: 22 Jacobian evaluations: 22 Hessian evaluations: 18 Number of subproblems solved: 18 test_uno_solve.R.............. 31 tests OK test_uno_solve.R.............. 32 tests OK test_uno_solve.R.............. 33 tests OK test_uno_solve.R.............. 34 tests OK test_uno_solve.R.............. 34 tests OK test_uno_solve.R.............. 34 tests OK Original model C model 2 variables, 1 constraints (0 equality, 1 inequality) Problem type: NLP Non-default options: QP_solver = HiGHS ────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Radius Phase ||Step|| Objective Infeas Statio Compl Status ────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - 1.00e+01 OPT - 5.000e+00 0.00e+00 4.47e+00 0.00e+00 initial point 1 1 - 1.00e+01 OPT 2.00e+00 1.250e-14 0.00e+00 2.24e-07 0.00e+00 ✔ (f-type) ────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Radius Phase ||Step|| Objective Infeas Statio Compl Status ────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (TR Fletcher-filter restoration inequality-constrained SQP method with exact Hessian and no inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 1.25e-14 Primal feasibility: 0 ┌ Stationarity residual: 2.236068e-07 │ Primal feasibility: 0 └ Complementarity residual: 0 CPU time: 0.010888s Iterations: 1 Objective evaluations: 2 Constraints evaluations: 2 Objective gradient evaluations: 2 Jacobian evaluations: 2 Hessian evaluations: 1 Number of subproblems solved: 1 test_uno_solve.R.............. 34 tests OK test_uno_solve.R.............. 35 tests OK test_uno_solve.R.............. 36 tests OK test_uno_solve.R.............. 37 tests OK test_uno_solve.R.............. 38 tests OK test_uno_solve.R.............. 38 tests OK Original model C model 2 variables, 1 constraints (0 equality, 1 inequality) Problem type: NLP Non-default options: QP_solver = HiGHS ────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Radius Phase ||Step|| Objective Infeas Statio Compl Status ────────────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - 1.00e+01 OPT - 5.000e+00 0.00e+00 4.47e+00 0.00e+00 initial point 1 1 - 1.00e+01 OPT 2.00e+00 1.250e-14 0.00e+00 2.24e-07 0.00e+00 ✔ (f-type) ────────────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Radius Phase ||Step|| Objective Infeas Statio Compl Status ────────────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (TR Fletcher-filter restoration inequality-constrained SQP method with exact Hessian and no inertia correction) Thu Jun 11 08:57:57 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 1.25e-14 Primal feasibility: 0 ┌ Stationarity residual: 2.236068e-07 │ Primal feasibility: 0 └ Complementarity residual: 0 CPU time: 0.009916s Iterations: 1 Objective evaluations: 2 Constraints evaluations: 2 Objective gradient evaluations: 2 Jacobian evaluations: 2 Hessian evaluations: 1 Number of subproblems solved: 1 test_uno_solve.R.............. 38 tests OK test_uno_solve.R.............. 39 tests OK test_uno_solve.R.............. 40 tests OK test_uno_solve.R.............. 41 tests OK test_uno_solve.R.............. 41 tests OK test_uno_solve.R.............. 41 tests OK test_uno_solve.R.............. 41 tests OK test_uno_solve.R.............. 41 tests OK test_uno_solve.R.............. 41 tests OK Original model C model 2 variables, 0 constraints (0 equality, 0 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 2 variables, 0 constraints (0 equality, 0 inequality) The model is unconstrained, picking no relaxation The problem has no constraints, picking a pure Newton method Non-default options: linear_solver = MUMPS ───────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Steplength Regulariz ||Step|| Objective Statio Compl Status ───────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - - 2.420e+01 2.16e+02 0.00e+00 initial point uno_binding.cpp:42:14: runtime error: null pointer passed as argument 2, which is declared to never be null #0 0x7bf4ac00bc22 in make_x /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/src/uno_binding.cpp:42 #1 0x7bf4ac17fca2 in invoke_iter_callback /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/src/uno_binding.cpp:143 #2 0x7bf4ac17fca2 in notify_acceptable_iterate_trampoline /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/src/uno_binding.cpp:179 #3 0x7bf4ac1a82c9 in CUserCallbacks::notify_acceptable_iterate(uno::Vector const&, uno::Multipliers const&, double, double, double, double) /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/interfaces/C/Uno_C_API.cpp:355 #4 0x7bf4ac3ef5f5 in uno::NoRelaxation::is_iterate_acceptable(uno::Statistics&, uno::Model const&, uno::Iterate&, uno::Iterate&, uno::Direction const&, double, bool, uno::EvaluationCache&, uno::WarmstartInformation&, uno::UserCallbacks&) /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/uno/ingredients/con_relax/NoRelaxation.cpp:105 #5 0x7bf4ac447837 in uno::BacktrackingLineSearch::backtrack_along_direction(uno::Statistics&, uno::Model const&, uno::Iterate&, uno::Iterate&, uno::Direction const&, uno::EvaluationCache&, uno::WarmstartInformation&, uno::UserCallbacks&) const /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/uno/ingredients/globalization_mechanisms/BacktrackingLineSearch.cpp:113 #6 0x7bf4ac449315 in uno::BacktrackingLineSearch::compute_next_iterate(uno::Statistics&, uno::Model const&, uno::Iterate&, uno::Iterate&, uno::EvaluationCache&, uno::WarmstartInformation&, uno::UserCallbacks&) /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/uno/ingredients/globalization_mechanisms/BacktrackingLineSearch.cpp:49 #7 0x7bf4ac225b22 in uno::Uno::uno_solve(uno::Model const&, uno::Options&, uno::UserCallbacks&) /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/uno/Uno.cpp:112 #8 0x7bf4ac1f6c9d in uno::Uno::solve(uno::Model const&, uno::Options&, uno::UserCallbacks&) /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/uno/Uno.cpp:59 #9 0x7bf4ac1cf402 in uno_optimize /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/inst/uno/interfaces/C/Uno_C_API.cpp:976 #10 0x7bf4ac197178 in uno_solve_impl(int, cpp11::r_vector, cpp11::r_vector, std::__cxx11::basic_string, std::allocator >, SEXPREC*, SEXPREC*, int, cpp11::r_vector, cpp11::r_vector, SEXPREC*, cpp11::r_vector, cpp11::r_vector, SEXPREC*, cpp11::r_vector, cpp11::r_vector, SEXPREC*, cpp11::r_vector, std::__cxx11::basic_string, std::allocator >, int, bool, cpp11::r_vector, std::__cxx11::basic_string, std::allocator >, SEXPREC*, SEXPREC*, SEXPREC*) /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/src/uno_binding.cpp:438 #11 0x7bf4ac19ba7e in _Uno_uno_solve_impl /data/gannet/ripley/R/packages/tests-gcc-SAN/Uno/src/cpp11.cpp:19 #12 0x00000074ea8d in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:900 #13 0x000000755cea in do_dotcall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:1437 #14 0x0000008d7a82 in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8150 #15 0x0000008c4ce3 in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7533 #16 0x00000086376a in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167 #17 0x00000087baaa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2398 #18 0x00000087fa5d in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2314 #19 0x000000863e18 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2333 #20 0x000000863e18 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1278 #21 0x00000087baaa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2398 #22 0x00000087fa5d in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2314 #23 0x000000863e18 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2333 #24 0x000000863e18 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1278 #25 0x0000008957ae in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3585 #26 0x000000864246 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1230 #27 0x00000089d321 in do_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3975 #28 0x0000008d7a82 in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8150 #29 0x0000008c4ce3 in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7533 #30 0x00000086376a in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167 #31 0x00000087baaa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2398 #32 0x00000087fa5d in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2314 #33 0x00000088169a in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2333 #34 0x00000088169a in R_forceAndCall /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2465 #35 0x00000049a056 in do_lapply /data/gannet/ripley/R/svn/R-devel/src/main/apply.c:75 #36 0x000000a9f276 in do_internal /data/gannet/ripley/R/svn/R-devel/src/main/names.c:1424 #37 0x0000008e4c91 in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8170 #38 0x0000008c4ce3 in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7533 #39 0x00000086376a in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167 #40 0x00000087baaa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2398 #41 0x00000087fa5d in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2314 #42 0x000000863e18 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2333 #43 0x000000863e18 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1278 #44 0x00000087801b in do_begin /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3001 #45 0x000000864246 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1230 #46 0x000000864246 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1230 #47 0x000000a0c4c8 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264 #48 0x000000a0c4c8 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317 #49 0x000000a1b7ba in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235 #50 0x000000a1b852 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242 #51 0x00000041309f in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29 #52 0x7ff4c8c12574 in __libc_start_call_main (/lib64/libc.so.6+0x3574) (BuildId: 92b5376d35bb29c098175948cf3e7cbcae3aeae1) #53 0x7ff4c8c12627 in __libc_start_main@GLIBC_2.2.5 (/lib64/libc.so.6+0x3627) (BuildId: 92b5376d35bb29c098175948cf3e7cbcae3aeae1) #54 0x000000413a84 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413a84) (BuildId: 7a0778f6b0234eb0198b1e1848c1105f472bf3b1) 1 1 1.00e+00 1.00e+00 0.00e+00 3.81e-01 4.732e+00 4.64e+00 0.00e+00 ✔ (Armijo) 2 1 1.00e+00 1.00e+00 0.00e+00 4.56e+00 1.412e+03 - - ✘ (Armijo) - 2 1.00e+00 5.00e-01 - 2.28e+00 8.975e+01 - - ✘ (Armijo) - 3 1.00e+00 2.50e-01 - 1.14e+00 8.395e+00 - - ✘ (Armijo) - 4 1.00e+00 1.25e-01 - 5.69e-01 4.087e+00 2.60e+01 0.00e+00 ✔ (Armijo) 3 1 1.00e+00 1.00e+00 0.00e+00 2.21e-01 3.229e+00 1.06e+01 0.00e+00 ✔ (Armijo) 4 1 1.00e+00 1.00e+00 0.00e+00 4.82e-01 3.214e+00 2.21e+01 0.00e+00 ✔ (Armijo) 5 1 1.00e+00 1.00e+00 0.00e+00 6.70e-02 1.943e+00 3.49e+00 0.00e+00 ✔ (Armijo) 6 1 1.00e+00 1.00e+00 0.00e+00 7.35e-01 2.954e+01 - - ✘ (Armijo) - 2 1.00e+00 5.00e-01 - 3.67e-01 2.933e+00 - - ✘ (Armijo) - 3 1.00e+00 2.50e-01 - 1.84e-01 1.600e+00 7.42e+00 0.00e+00 ✔ (Armijo) 7 1 1.00e+00 1.00e+00 0.00e+00 1.44e-01 1.178e+00 4.13e+00 0.00e+00 ✔ (Armijo) 8 1 1.00e+00 1.00e+00 0.00e+00 2.08e-01 9.224e-01 8.63e+00 0.00e+00 ✔ (Armijo) 9 1 1.00e+00 1.00e+00 0.00e+00 8.91e-02 5.975e-01 1.59e+00 0.00e+00 ✔ (Armijo) 10 1 1.00e+00 1.00e+00 0.00e+00 2.97e-01 1.003e+00 - - ✘ (Armijo) - 2 1.00e+00 5.00e-01 - 1.49e-01 4.526e-01 5.21e+00 0.00e+00 ✔ (Armijo) 11 1 1.00e+00 1.00e+00 0.00e+00 1.02e-01 2.808e-01 1.99e+00 0.00e+00 ✔ (Armijo) 12 1 1.00e+00 1.00e+00 0.00e+00 1.77e-01 2.114e-01 7.20e+00 0.00e+00 ✔ (Armijo) 13 1 1.00e+00 1.00e+00 0.00e+00 9.45e-02 8.902e-02 4.84e-01 0.00e+00 ✔ (Armijo) 14 1 1.00e+00 1.00e+00 0.00e+00 2.84e-01 1.705e-01 - - ✘ (Armijo) - 2 1.00e+00 5.00e-01 - 1.42e-01 5.154e-02 3.22e+00 0.00e+00 ✔ (Armijo) 15 1 1.00e+00 1.00e+00 0.00e+00 1.09e-01 1.999e-02 1.00e+00 0.00e+00 ✔ (Armijo) 16 1 1.00e+00 1.00e+00 0.00e+00 1.39e-01 7.169e-03 2.21e+00 0.00e+00 ✔ (Armijo) 17 1 1.00e+00 1.00e+00 0.00e+00 5.50e-02 1.070e-03 1.96e-01 0.00e+00 ✔ (Armijo) 18 1 1.00e+00 1.00e+00 0.00e+00 5.53e-02 7.777e-05 3.10e-01 0.00e+00 ✔ (Armijo) 19 1 1.00e+00 1.00e+00 0.00e+00 7.31e-03 2.825e-07 3.23e-03 0.00e+00 ✔ (Armijo) 20 1 1.00e+00 1.00e+00 0.00e+00 1.05e-03 8.517e-12 1.06e-04 0.00e+00 ✔ (Armijo) 21 1 1.00e+00 1.00e+00 0.00e+00 2.49e-06 3.744e-21 3.73e-10 0.00e+00 ✔ (Armijo) ───────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Steplength Regulariz ||Step|| Objective Statio Compl Status ───────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS merit pure Newton method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:58 2026 ──────────────────────────────────────── Optimization status: Success Solution status: Feasible KKT point Objective value: 3.743976e-21 Primal feasibility: 0 ┌ Stationarity residual: 3.732501e-10 │ Primal feasibility: 0 └ Complementarity residual: 0 CPU time: 0.940377s Iterations: 21 Objective evaluations: 29 Constraints evaluations: 0 Objective gradient evaluations: 29 Jacobian evaluations: 0 Hessian evaluations: 21 Number of subproblems solved: 0 test_uno_solve.R.............. 41 tests OK test_uno_solve.R.............. 42 tests OK test_uno_solve.R.............. 43 tests OK test_uno_solve.R.............. 44 tests OK test_uno_solve.R.............. 44 tests OK Original model C model 2 variables, 0 constraints (0 equality, 0 inequality) Problem type: NLP Reformulated model C model -> no fixed bounds -> equality constrained -> bounds relaxed 2 variables, 0 constraints (0 equality, 0 inequality) The model is unconstrained, picking no relaxation The problem has no constraints, picking a pure Newton method Non-default options: linear_solver = MUMPS ───────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Steplength Regulariz ||Step|| Objective Statio Compl Status ───────────────────────────────────────────────────────────────────────────────────────────────────── 0 - - - - - 2.420e+01 2.16e+02 0.00e+00 initial point 1 1 1.00e+00 1.00e+00 0.00e+00 3.81e-01 4.732e+00 4.64e+00 0.00e+00 ✔ (Armijo) 2 1 1.00e+00 1.00e+00 0.00e+00 4.56e+00 1.412e+03 - - ✘ (Armijo) - 2 1.00e+00 5.00e-01 - 2.28e+00 8.975e+01 - - ✘ (Armijo) - 3 1.00e+00 2.50e-01 - 1.14e+00 8.395e+00 - - ✘ (Armijo) - 4 1.00e+00 1.25e-01 - 5.69e-01 4.087e+00 2.60e+01 0.00e+00 ✔ (Armijo) 3 1 1.00e+00 1.00e+00 0.00e+00 2.21e-01 3.229e+00 1.06e+01 0.00e+00 ✔ (Armijo) ───────────────────────────────────────────────────────────────────────────────────────────────────── Iterations Major Minor Penalty Steplength Regulariz ||Step|| Objective Statio Compl Status ───────────────────────────────────────────────────────────────────────────────────────────────────── Uno 2.7.3 (LS merit pure Newton method with exact Hessian and primal-dual inertia correction) Thu Jun 11 08:57:58 2026 ──────────────────────────────────────── Optimization status: User termination Solution status: Suboptimal point Objective value: 3.228673 Primal feasibility: 0 ┌ Stationarity residual: 10.64945 │ Primal feasibility: 0 └ Complementarity residual: 0 CPU time: 0.007942s Iterations: 3 Objective evaluations: 7 Constraints evaluations: 0 Objective gradient evaluations: 7 Jacobian evaluations: 0 Hessian evaluations: 3 Number of subproblems solved: 0 test_uno_solve.R.............. 44 tests OK test_uno_solve.R.............. 45 tests OK test_uno_solve.R.............. 46 tests OK test_uno_solve.R.............. 46 tests OK test_uno_solve.R.............. 46 tests OK test_uno_solve.R.............. 47 tests OK test_uno_solve.R.............. 48 tests OK 1.7s All ok, 48 results (1.7s) > > proc.time() user system elapsed 4.174 0.370 4.706