Learn R Programming

cccp (version 0.3-3)

Cone Constrained Convex Problems

Description

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 for more information).

Copy Link

Version

Install

install.packages('cccp')

Monthly Downloads

9,348

Version

0.3-3

License

GPL (>= 3)

Maintainer

Bernhard Pfaff

Last Published

September 27th, 2025

Functions in cccp (0.3-3)

dlp

Creating a member object of the reference-class DLP
rp

Risk-parity optimization
socc

Definition of second-oder cone inequality constraints
dnl

Creating a member object of the reference-class DNL
nlfc

Definition of nonlinear inequality constraints
nnoc

Definition of linear inequality constraints
Rcpp_DLP-class

Class "Rcpp_DLP"
Rcpp_CPS-class

Class "Rcpp_CPS"
Rcpp_DQP-class

Class "Rcpp_DQP"
Rcpp_DCP-class

Class "Rcpp_DCP"
Rcpp_DNL-class

Class "Rcpp_DNL"
cps

Solving a convex program
CPG

Rcpp module: CPG
Rcpp_CONEC-class

Class "Rcpp_CONEC"
gp

Geometric program
Rcpp_CTRL-class

Class "Rcpp_CTRL"
Rcpp_PDV-class

Class "Rcpp_PDV"
CPD-class

Class "CPD"
cccp

Solving linear and quadratic programs with cone constraints
l1

Minimizing L1-norm
dqp

Creating a member object of the reference-class DQP
getFoo

Extractor methods for reference class objects
psdc

Definition of positive semidefinite cone inequality constraints
dcp

Creating a member object of the reference-class DCP
ctrl

Creating objects of reference-class CTRL