CVXOPT: Convex Optimization

Discussion topics for individual codes
Post Reply
Ada Coda
ASCL Robot
Posts: 1702
Joined: Thu May 08, 2014 5:37 am

CVXOPT: Convex Optimization

Post by Ada Coda » Mon Aug 31, 2020 2:59 am

CVXOPT: Convex Optimization

Abstract: CVXOPT makes the development of software for convex optimization applications straightforward by building on Python’s extensive standard library and on the strengths of Python as a high-level programming language. It offers efficient Python classes for dense and sparse matrices (real and complex) with Python indexing and slicing and overloaded operations for matrix arithmetic, an interface to the fast Fourier transform routines from FFTW, and an interface to most of the double-precision real and complex BLAS. It contains routines for linear, second-order cone, and semidefinite programming problems, and for nonlinear convex optimization. CVXOPT also provides an interface to LAPACK routines for solving linear equations and least-squares problems, matrix factorizations (LU, Cholesky, LDLT and QR), symmetric eigenvalue and singular value decomposition, and Schur factorization, and a modeling tool for specifying convex piecewise-linear optimization problems.

Credit: Andersen, Martin; Dahl, Joachim; Vandenberghe, Lieven

Site: https://github.com/cvxopt/cvxopt
https://ui.adsabs.harvard.edu/abs/2019PhRvD..99j3019K

Bibcode: 2020ascl.soft08017A

ID: ascl:2008.017

Post Reply