| Title: | Embedded Conic Solver in R |
|---|---|
| Description: | R interface to the Embedded COnic Solver (ECOS), an efficient and robust C library for convex problems. Conic and equality constraints can be specified in addition to integer and boolean variable constraints for mixed-integer problems. This R interface is inspired by the python interface and has similar calling conventions. |
| Authors: | Anqi Fu [aut], Balasubramanian Narasimhan [aut, cre], Florian Schwendinger [ctb], Martin Maechler [ctb] |
| Maintainer: | Balasubramanian Narasimhan <[email protected]> |
| License: | GPL(>=3) |
| Version: | 0.6.2 |
| Built: | 2026-10-16 21:49:04 UTC |
| Source: | https://github.com/bnaras/ECOSolveR |
Frees the C-level ECOS workspace. After this call the workspace external pointer is invalidated and cannot be used for further solves or updates. It is safe to call this more than once.
ECOS_cleanup(workspace)ECOS_cleanup(workspace)
workspace |
an external pointer of class |
NULL, invisibly.
ECOS_setup, ECOS_solve,
ECOS_update
The function ECOS_csolve is a wrapper around the ecos
csolve C function. Conic constraints are specified using the
and parameters and can be NULL and zero
length vector respectively indicating an absence of conic
constraints. Similarly, equality constraints are specified via
and parameters with NULL and empty vector
values representing a lack of such constraints. At most one of the
pair or is allowed to be absent.
ECOS_csolve( c = numeric(0), G = NULL, h = numeric(0), dims = list(l = integer(0), q = NULL, e = integer(0)), A = NULL, b = numeric(0), bool_vars = integer(0), int_vars = integer(0), control = ecos.control() )ECOS_csolve( c = numeric(0), G = NULL, h = numeric(0), dims = list(l = integer(0), q = NULL, e = integer(0)), A = NULL, b = numeric(0), bool_vars = integer(0), int_vars = integer(0), control = ecos.control() )
c |
the coefficients of the objective function; the length of
this determines the number of variables |
G |
the inequality constraint matrix in one of three forms: a
plain matrix, simple triplet matrix, or compressed column
format, e.g. dgCMatrix-class. Can also be
|
h |
the right hand side of the inequality constraint. Can be empty numeric vector. |
dims |
is a list of three named elements: |
A |
the optional equality constraint matrix in one of three
forms: a plain matrix, simple triplet matrix, or compressed
column format, e.g. dgCMatrix-class. Can be
|
b |
the right hand side of the equality constraint, must be
specified if |
bool_vars |
the indices of the variables, 1 through |
int_vars |
the indices of the variables, 1 through |
control |
is a named list that controls various optimization parameters; see ecos.control. |
a list of 8 named items
primal variables
dual variables for equality constraints
slacks for ,
dual variables for inequality constraints
gives information about the status of solution
a named integer vector containing four elements
0=ECOS_OPTIMAL, 1=ECOS_PINF,
2=ECOS_DINF, 10=ECOS_INACC_OFFSET, -1=ECOS_MAXIT,
-2=ECOS_NUMERICS, -3=ECOS_OUTCONE, -4=ECOS_SIGINT,
-7=ECOS_FATAL. See ECOS_exitcodes
.
the number of iterations used
the number of iterations for mixed integer problems
a non-zero number if a numeric error occurred
a named numeric vector containing
value of primal objective
value of dual objective
primal residual on inequalities and equalities
dual residual
primal infeasibility measure
dual infeasibility measure
primal infeasibility residual
dual infeasibility residual
duality gap
relative duality gap
Unknown at the moment to this R package maintainer.
a named numeric vector of timing information consisting of
the total runtime in ecos
the time for setup of the problem
the time to solve the problem
A call to this function will solve the problem:
minimize , subject to , and .
Variables can be constrained to be boolean (1 or 0) or integers. This is indicated
by specifying parameters bool_vars and/or int_vars respectively. If so
indicated, the solutions will be found using a branch and bound algorithm.
## githubIssue98 cat("Basic matrix interface\n") Gmat <- matrix(c(0.416757847405471, 2.13619609566845, 1.79343558519486, 0, 0, 0, 0, -1, 0, 0, 0, 0.056266827226329, -1.64027080840499, 0.841747365656204, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0.416757847405471, 2.13619609566845, 1.79343558519486, 0, 0, 0, -1, 0, 0, 0, 0, 0.056266827226329, -1.64027080840499, 0.841747365656204, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0), ncol = 5L) c <- as.numeric(c(0, 0, 0, 0, 1)) h <- as.numeric(c(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)) dims <- list(l = 6L, q = 5L, e = 0L) ECOS_csolve(c = c, G = Gmat, h = h, dims = dims, A = NULL, b = numeric(0)) cat("Simple Triplet Matrix interface, if you have package slam\n") if (requireNamespace("slam")) { ECOS_csolve(c = c, G = slam::as.simple_triplet_matrix(Gmat), h = h, dims = dims, A = NULL, b = numeric(0)) } if (requireNamespace("Matrix")) { ECOS_csolve(c = c, G = Matrix::Matrix(Gmat), h = h, dims = dims, A = NULL, b = numeric(0)) } ## Larger problems using saved data can be found in the test suite. ## Here is one if (requireNamespace("Matrix")) { MPC01 <- readRDS(system.file("testdata", "MPC01_1.RDS", package = "ECOSolveR")) G <- Matrix::sparseMatrix(x = MPC01$Gpr, i = MPC01$Gir, p = MPC01$Gjc, dims = c(MPC01$m, MPC01$n), index1 = FALSE) h <- MPC01$h dims <- lapply(list(l = MPC01$l, q=MPC01$q, e=MPC01$e), as.integer) retval <- ECOS_csolve(c = MPC01$c, G=G, h = h, dims = dims, A = NULL, b = NULL, control = ecos.control(verbose=1L)) retval$retcodes retval$infostring retval$summary }## githubIssue98 cat("Basic matrix interface\n") Gmat <- matrix(c(0.416757847405471, 2.13619609566845, 1.79343558519486, 0, 0, 0, 0, -1, 0, 0, 0, 0.056266827226329, -1.64027080840499, 0.841747365656204, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0.416757847405471, 2.13619609566845, 1.79343558519486, 0, 0, 0, -1, 0, 0, 0, 0, 0.056266827226329, -1.64027080840499, 0.841747365656204, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0), ncol = 5L) c <- as.numeric(c(0, 0, 0, 0, 1)) h <- as.numeric(c(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)) dims <- list(l = 6L, q = 5L, e = 0L) ECOS_csolve(c = c, G = Gmat, h = h, dims = dims, A = NULL, b = numeric(0)) cat("Simple Triplet Matrix interface, if you have package slam\n") if (requireNamespace("slam")) { ECOS_csolve(c = c, G = slam::as.simple_triplet_matrix(Gmat), h = h, dims = dims, A = NULL, b = numeric(0)) } if (requireNamespace("Matrix")) { ECOS_csolve(c = c, G = Matrix::Matrix(Gmat), h = h, dims = dims, A = NULL, b = numeric(0)) } ## Larger problems using saved data can be found in the test suite. ## Here is one if (requireNamespace("Matrix")) { MPC01 <- readRDS(system.file("testdata", "MPC01_1.RDS", package = "ECOSolveR")) G <- Matrix::sparseMatrix(x = MPC01$Gpr, i = MPC01$Gir, p = MPC01$Gjc, dims = c(MPC01$m, MPC01$n), index1 = FALSE) h <- MPC01$h dims <- lapply(list(l = MPC01$l, q=MPC01$q, e=MPC01$e), as.integer) retval <- ECOS_csolve(c = MPC01$c, G=G, h = h, dims = dims, A = NULL, b = NULL, control = ecos.control(verbose=1L)) retval$retcodes retval$infostring retval$summary }
A two-column data frame consisting of the code and description for the ECOS solver with ECOS symbolic code names as row names
Creates an ECOS workspace that can be solved, updated with new numerical data, and solved again without repeating the expensive symbolic analysis phase. This is useful for parametric optimization, model predictive control, and other settings where the problem structure stays the same but data changes.
ECOS_setup( c, G, h, dims = list(l = integer(0), q = NULL, e = integer(0)), A = NULL, b = numeric(0), control = ecos.control() )ECOS_setup( c, G, h, dims = list(l = integer(0), q = NULL, e = integer(0)), A = NULL, b = numeric(0), control = ecos.control() )
c |
the coefficients of the objective function; the length of
this determines the number of variables |
G |
the inequality constraint matrix in one of three forms: a
plain matrix, simple triplet matrix, or compressed column
format, e.g. dgCMatrix-class. Can also be
|
h |
the right hand side of the inequality constraint. Can be empty numeric vector. |
dims |
is a list of three named elements: |
A |
the optional equality constraint matrix in one of three
forms: a plain matrix, simple triplet matrix, or compressed
column format, e.g. dgCMatrix-class. Can be
|
b |
the right hand side of the equality constraint, must be
specified if |
control |
is a named list that controls various optimization parameters; see ecos.control. |
an external pointer of class "ecos_workspace".
Must eventually be freed via ECOS_cleanup or R
garbage collection.
ECOS_solve, ECOS_update,
ECOS_cleanup, ECOS_csolve
Calls ECOS_solve on an existing workspace created by
ECOS_setup. The workspace can be solved multiple
times, optionally with ECOS_update calls in between
to change numerical data.
ECOS_solve(workspace, control = NULL)ECOS_solve(workspace, control = NULL)
workspace |
an external pointer of class |
control |
optional named list of solver parameters (see
|
the same result list as ECOS_csolve.
ECOS_setup, ECOS_update,
ECOS_cleanup
Replaces numerical values in an existing ECOS workspace without
repeating symbolic analysis. The sparsity structure must remain
the same; only the non-zero values of G and A, and the dense
vectors c, h, b can be updated. Pass NULL for any argument
to leave it unchanged.
ECOS_update(workspace, Gpr = NULL, Apr = NULL, c = NULL, h = NULL, b = NULL)ECOS_update(workspace, Gpr = NULL, Apr = NULL, c = NULL, h = NULL, b = NULL)
workspace |
an external pointer of class |
Gpr |
numeric vector of new non-zero values for G (same length
as original), or |
Apr |
numeric vector of new non-zero values for A (same length
as original), or |
c |
numeric vector of new objective coefficients, or |
h |
numeric vector of new inequality RHS, or |
b |
numeric vector of new equality RHS, or |
the workspace object, invisibly.
ECOS_setup, ECOS_solve,
ECOS_cleanup
This is used to control the behavior of the underlying optimization code.
ecos.control( maxit = 100L, feastol = 1e-08, reltol = 1e-08, abstol = 1e-08, feastol_inacc = 1e-04, abstol_inacc = 5e-05, reltol_inacc = 5e-05, verbose = 0L, mi_max_iters = 1000L, mi_int_tol = 1e-04, mi_abs_eps = 1e-06, mi_rel_eps = 1e-06 )ecos.control( maxit = 100L, feastol = 1e-08, reltol = 1e-08, abstol = 1e-08, feastol_inacc = 1e-04, abstol_inacc = 5e-05, reltol_inacc = 5e-05, verbose = 0L, mi_max_iters = 1000L, mi_int_tol = 1e-04, mi_abs_eps = 1e-06, mi_rel_eps = 1e-06 )
maxit |
the maximum number of iterations for ecos, default 100L |
feastol |
the tolerance on the primal and dual residual, default 1e-8 |
reltol |
the relative tolerance on the duality gap, default 1e-8 |
abstol |
the absolute tolerance on the duality gap, default 1e-8 |
feastol_inacc |
the tolerance on the primal and dual residual if reduced precisions, default 1e-4 |
abstol_inacc |
the absolute tolerance on the duality gap if reduced precision, default 5e-5 |
reltol_inacc |
the relative tolerance on the duality gap if reduced precision, default 5e-5 |
verbose |
verbosity level, default 0L. A verbosity level of 1L will show more detail, but clutter session transcript. |
mi_max_iters |
the maximum number of branch and bound iterations (mixed integer problems only), default 1000L |
mi_int_tol |
the integer tolerence (mixed integer problems only), default 1e-4 |
mi_abs_eps |
the absolute tolerance between upper and lower bounds (mixed integer problems only), default 1e-6 |
mi_rel_eps |
the relative tolerance, |
a list with the following elements:
the tolerance on the primal and dual residual, parameter feastol
the absolute tolerance on the duality gap, parameter abstol
the relative tolerance on the duality gap, parameter reltol
the tolerance on the primal and dual residual if reduced precisions, parameter feastol_inacc
the absolute tolerance on the duality gap if reduced precision, parameter abstol_inacc
the relative tolerance on the duality gap if reduced precision, parameter reltol_inacc
the maximum number of iterations for ecos, parameter maxit
the maximum number of branch and bound iterations (mixed integer problems only), parameter mi_max_iters
the integer tolerence (mixed integer problems only), parameter mi_int_tol
the absolute tolerance between upper and lower bounds (mixed integer problems only), parameter mi_abs_eps
the relative tolerance, , between upper and lower bounds (mixed integer problems only), parameter mi_rel_eps
verbosity level, parameter verbose
Print method for ECOS workspace objects
## S3 method for class 'ecos_workspace' print(x, ...)## S3 method for class 'ecos_workspace' print(x, ...)
x |
an |
... |
ignored. |
x, invisibly.