Routines for solving convex optimization problems with cone constraints by means of interior-point methods. The implemented algorithms are partially ported from CVXOPT, a Python module for convex optimization (see <https://cvxopt.org> for more information).
Version: 0.3-1 Depends: R (≥ 3.0.1), methods Imports: Rcpp (≥ 0.11.2) LinkingTo: Rcpp, RcppArmadillo Suggests: RUnit, numDeriv Published: 2023-12-09 DOI: 10.32614/CRAN.package.cccp Author: Bernhard Pfaff [aut, cre], Lieven Vandenberghe [cph] (copyright holder of cvxopt), Martin Andersen [cph] (copyright holder of cvxopt), Joachim Dahl [cph] (copyright holder of cvxopt) Maintainer: Bernhard Pfaff <bernhard at pfaffikus.de> License: GPL (≥ 3) NeedsCompilation: yes In views: Optimization CRAN checks: cccp results Documentation: Downloads: Reverse dependencies: Linking:Please use the canonical form https://CRAN.R-project.org/package=cccp to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4