For further details please consult the OSQP documentation: https://osqp.org/
osqpSettings(
rho = 0.1,
sigma = 1e-06,
max_iter = 4000L,
eps_abs = 0.001,
eps_rel = 0.001,
eps_prim_inf = 1e-04,
eps_dual_inf = 1e-04,
alpha = 1.6,
linsys_solver = c(QDLDL_SOLVER = 0L),
delta = 1e-06,
polish = FALSE,
polish_refine_iter = 3L,
verbose = TRUE,
scaled_termination = FALSE,
check_termination = 25L,
warm_start = TRUE,
scaling = 10L,
adaptive_rho = 1L,
adaptive_rho_interval = 0L,
adaptive_rho_tolerance = 5,
adaptive_rho_fraction = 0.4,
time_limit = 0
)
ADMM step rho
ADMM step sigma
maximum iterations
absolute convergence tolerance
relative convergence tolerance
primal infeasibility tolerance
dual infeasibility tolerance
relaxation parameter
which linear systems solver to use, 0=QDLDL, 1=MKL Pardiso
regularization parameter for polish
boolean, polish ADMM solution
iterative refinement steps in polish
boolean, write out progress
boolean, use scaled termination criteria
integer, check termination interval. If 0, termination checking is disabled
boolean, warm start
heuristic data scaling iterations. If 0, scaling disabled
cboolean, is rho step size adaptive?
Number of iterations between rho adaptations rho. If 0, it is automatic
Tolerance X for adapting rho. The new rho has to be X times larger or 1/X times smaller than the current one to trigger a new factorization
Interval for adapting rho (fraction of the setup time)
run time limit with 0 indicating no limit