CVXPY: a Python-embedded modeling language for convex optimization
From MaRDI portal
Abstract: CVXPY is a domain-specific language for convex optimization embedded in Python. It allows the user to express convex optimization problems in a natural syntax that follows the math, rather than in the restrictive standard form required by solvers. CVXPY makes it easy to combine convex optimization with high-level features of Python such as parallelism and object-oriented design. CVXPY is available at http://www.cvxpy.org/ under the GPL license, along with documentation and examples.
Recommendations
Cited in
(only showing first 100 items - show all)- Modulus metrics on networks
- Polyhedral approximation in mixed-integer convex optimization
- Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
- Single-forward-step projective splitting: exploiting cocoercivity
- Tax-aware portfolio construction via convex optimization
- Improving neural network verification through spurious region guided refinement
- The voice of optimization
- Adaptive sparse group LASSO in quantile regression
- Optimal representative sample weighting
- Large scale model predictive control with neural networks and primal active sets
- Design and implementation of a modular interior-point solver for linear optimization
- Estimating variances in time series kriging using convex optimization and empirical BLUPs
- Positivity-preserving adaptive Runge-Kutta methods
- Newton polytopes and relative entropy optimization
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
- Convex optimization with an interpolation-based projection and its application to deep learning
- Imitation learning of stabilizing policies for nonlinear systems
- System level disturbance reachable sets and their application to tube-based MPC
- Machine learning for fluid flow reconstruction from limited measurements
- Eigen-stratified models
- Bounds-constrained polynomial approximation using the Bernstein basis
- Predictive online convex optimization
- SUSPECT: MINLP special structure detector for Pyomo
- Inverse optimization in semi-infinite linear programs
- Fully-discrete analysis of high-order spatial discretizations with optimal explicit Runge-Kutta methods
- Outer approximation with conic certificates for mixed-integer convex problems
- Estimating changes in the observed relationship between humidity and temperature using noncrossing quantile smoothing splines
- Optimal estimation of Gaussian mixtures via denoised method of moments
- Disciplined quasiconvex programming
- A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
- Automatic repair of convex optimization problems
- Solution refinement at regular points of conic problems
- Multi-period portfolio selection with drawdown control
- Network optimization for unified packet and circuit switched networks
- Disciplined geometric programming
- A distributed method for optimal capacity reservation
- Temporal hierarchies with autocorrelation for load forecasting
- A convex optimization approach to radiation treatment planning with dose constraints
- A second-order cone model of transmission planning with alternating and direct current lines
- T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
- Variations and extension of the convex-concave procedure
- Stochastic matrix-free equilibration
- CVXPY
- Multi-period portfolio optimization using model predictive control with mean-variance and risk parity frameworks
- On the utility maximization of the discrepancy between a perceived and market implied risk neutral distribution
- Enhancing phenomenological yield functions with data: challenges and opportunities
- Bregman three-operator splitting methods
- Optimal recovery from inaccurate data in Hilbert spaces: regularize, but what of the parameter?
- \textsc{PySCIPOpt}: mathematical programming in Python with the SCIP optimization suite
- Matrix-free convex optimization modeling
- Conic optimization via operator splitting and homogeneous self-dual embedding
- An introduction to compressed sensing
- Dynamic energy management
- Gradient-based Regularization Parameter Selection for Problems With Nonsmooth Penalty Functions
- An Iterative Sparse-Group Lasso
- CVXGEN: a code generator for embedded convex optimization
- Dynamic portfolio optimization across hidden market regimes
- A general system for heuristic minimization of convex functions over non-convex sets
- FOM -- a MATLAB toolbox of first-order methods for solving convex optimization problems
- Dynamic portfolio optimization across hidden market regimes
- scientific article; zbMATH DE number 7370577 (Why is no real title available?)
- A unified analysis of first-order methods for smooth games via integral quadratic constraints
- Operator splitting for a homogeneous embedding of the linear complementarity problem
- Automating the formulation and resolution of convex variational problems. Applications from image processing to computational mechanics
- Computing large market equilibria using abstractions
- Maximum a posteriori inference of random dot product graphs via conic programming
- Robust optimization of schedules affected by uncertain events
- scientific article; zbMATH DE number 7626710 (Why is no real title available?)
- Quantifying non-Markovian Memory in a Superconducting Quantum Computer
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
- Solving Natural Conic Formulations with Hypatia.jl
- Operator splitting for adaptive radiation therapy with nonlinear health dynamics
- Convexification with bounded gap for randomly projected quadratic optimization
- Accelerated stochastic algorithms for convex-concave saddle-point problems
- Efficient allocations in double auction markets
- Revisit to functional data analysis of sleeping energy expenditure
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Online Mixed-Integer Optimization in Milliseconds
- Sample complexity of sample average approximation for conditional stochastic optimization
- Geometry of graph partitions via optimal transport
- Anderson Accelerated Douglas--Rachford Splitting
- Dual extrapolation for sparse GLMs
- FANOK: knockoffs in linear time
- scientific article; zbMATH DE number 7164690 (Why is no real title available?)
- Morphological Perceptrons: Geometry and Training Algorithms
- SnapVX: a network-based convex optimization solver
- Disciplined convex programming
- JuMP: a modeling language for mathematical optimization
- A generic coordinate descent solver for non-smooth convex optimisation
- Capacity of the covariance perceptron
- Signal Decomposition Using Masked Proximal Operators
- Linear programming with nonparametric penalty programs and iterated thresholding
- Mathematical programming formulations for the alternating current optimal power flow problem
- Mathematical programming formulations for the alternating current optimal power flow problem
- Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
- Optimal estimation of high-dimensional Gaussian location mixtures
- Linear optimization over homogeneous matrix cones
- Variable metric method for unconstrained multiobjective optimization problems
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Constraint reformulations for set point optimization problems using fuzzy cognitive map models
This page was built for publication: CVXPY: a Python-embedded modeling language for convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810900)
