CVXR: An R Package for Disciplined Convex Optimization
arXiv:1711.07582 · doi:10.18637/jss.v094.i14
Abstract
CVXR is an R package that provides an object-oriented modeling language for convex optimization, similar to CVX, CVXPY, YALMIP, and Convex.jl. It allows the user to formulate convex optimization problems in a natural mathematical syntax rather than the restrictive form required by most solvers. The user specifies an objective and set of constraints by combining constants, variables, and parameters using a library of functions with known mathematical properties. CVXR then applies signed disciplined convex programming (DCP) to verify the problem's convexity. Once verified, the problem is converted into standard conic form using graph implementations and passed to a cone solver such as ECOS or SCS. We demonstrate CVXR's modeling framework with several applications.
34 pages, 9 figures
Cited by in corpus (9)
- Fair Regression for Health Care Spending
- An autocovariance-based learning framework for high-dimensional functional time series
- Rdimtools: An R package for Dimension Reduction and Intrinsic Dimension Estimation
- sparsegl: An R Package for Estimating Sparse Group Lasso
- Robust optimal estimation of location from discretely sampled functional data
- Distributional Anchor Regression
- Asymptotics for M-type smoothing splines with non-smooth objective functions
- Mixed-integer linear programming for computing optimal experimental designs
- A General Framework for Empirical Bayes Estimation in Discrete Linear Exponential Family