CVXR (1.0-1)

0 users

Disciplined Convex Optimization.

An object-oriented modeling language for disciplined convex programming (DCP). It allows the user to formulate convex optimization problems in a natural way following mathematical convention and DCP rules. The system analyzes the problem, verifies its convexity, converts it into a canonical form, and hands it off to an appropriate solver to obtain the solution.

Maintainer: Anqi Fu
Author(s): Anqi Fu [aut, cre], Balasubramanian Narasimhan [aut], David W Kang [aut], Steven Diamond [aut], John Miller [aut], Stephen Boyd [ctb], Paul Kunsberg Rosenfield [ctb]

License: Apache License 2.0 | file LICENSE

Uses: bit64, ECOSolveR, gmp, Matrix, osqp, R6, Rcpp, Rmpfr, scs, nnls, Rcplex, Rglpk, slam, testthat, rmosek, knitr, rmarkdown, covr
Reverse depends: tramnet
Reverse suggests: portfolioBacktest, spectralGraphTopology, updog

Released about 1 month ago.

10 previous versions



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of CVXR yet. Want to be the first? Write one now.

Related packages: DEoptim, LowRankQP, TSP, boot, bvls, clue, desirability, gafit, genalg, glpk, gsl, igraph, kernlab, linprog, lpSolve, minpack.lm, nls2, nnls, optmatch, powell(20 best matches, based on common tags.)

Search for CVXR on google, google scholar, r-help, r-devel.

Visit CVXR on R Graphical Manual.