(Robust) Canonical Correlation Analysis via Projection Pursuit
R (>= 3.2.0), parallel, pcaPP (>= 1.8-1), robustbase

Canonical correlation analysis and maximum correlation via
projection pursuit, as well as fast implementations of correlation
estimators, with a focus on robust and non-parametric methods.

Client for Climate Change, Agriculture, and Food Security ('CCAFS')
General Circulation Models ('GCM') data. Data is stored in Amazon 'S3', from
which we provide functions to fetch data.
roxygen2 (>= 5.0.1), testthat, covr, knitr

rappdirs, crul, raster, tibble, xml2, jsonlite, data.table
data, climate change, agriculture, gcm, general
circulation model, ccafs

c(person("Zhu", "Wang", role = c("aut", "cre"),
email = "zhuwang@gmail.com",
comment = c(ORCID = "0000-0002-0773-0052")))
Robust functional descent algorithm for concave-convex family through composite optimization by conjugation operator. Wang (2021) <arXiv:2101.07718>.

Class Cover Catch Digraphs, neighborhood graphs, and
relatives.
Distribution A: Approved for Public Release

c(
person("Muhlis", "Ozdemir", email = "muhlisozdemir@gazi.edu.tr", role = c("aut","cre"), comment = c(ORCID = "0000-0002-4921-8209")),
person("Seda Tugce", "Altan", email = "stugce.altan@gazi.edu.tr", role = c("aut","ctb"), comment = c(ORCID = "0000-0003-0431-5256")),
person("Meral", "Ebegil", email = "mdemirel@gazi.edu.tr", role = c("aut","ctb", "ths"), comment = c(ORCID = "0000-0003-4798-3422")))
Calculates the credit debt for the next period based on the available data using the cross-classification credibility model.
Muhlis Ozdemir [aut, cre] (<https://orcid.org/0000-0002-4921-8209>),
Seda Tugce Altan [aut, ctb] (<https://orcid.org/0000-0003-0431-5256>),
Meral Ebegil [aut, ctb, ths] (<https://orcid.org/0000-0003-4798-3422>)

c(person("Bernhard", "Pfaff", role = c("aut", "cre"), email = "bernhard@pfaffikus.de"), person("Lieven", "Vandenberghe", role = "cph", comment = "copyright holder of cvxopt"), person("Martin", "Andersen", role = "cph", comment = "copyright holder of cvxopt"), person("Joachim", "Dahl", role = "cph", comment = "copyright holder of cvxopt"))
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 <http://cvxopt.org> for more information).
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)