swMATH4321MaRDI QIDQ16500FDOQ16500
Author name not available (Why is that?)
Official website: http://cvxopt.org/
Cited In (only showing first 100 items - show all)
- A conservative mesh-free scheme and generalized framework for conservation laws
- Signomial and polynomial optimization via relative entropy and partial dualization
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Ratio-balanced maximum flows
- On the measurable chromatic number of a space of dimension \(n \leq 24\)
- A scaled gradient projection method for Bayesian learning in dynamical systems
- Sageopt
- A biased random-key genetic algorithm for road congestion minimization
- CVXPY: a Python-embedded modeling language for convex optimization
- Robust generalized eigenvalue classifier with ellipsoidal uncertainty
- Random projections for conic programs
- A theoretical and empirical analysis of support vector machine methods for multiple-instance classification
- Shape optimization with nonsmooth cost functions: from theory to numerics
- Safe autonomy under perception uncertainty using chance-constrained temporal logic
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Incorporation of flexible objectives and time-linked simulation with flux balance analysis
- Detecting and repairing arbitrage in traded option prices
- Covariance selection for nonchordal graphs via chordal embedding
- Generalized network measures based on modulus of families of walks
- Null space gradient flows for constrained optimization with applications to shape optimization
- Cooperation, conformity, and the coevolutionary problem of trait associations
- Inexact proximal Newton methods for self-concordant functions
- Solving Natural Conic Formulations with Hypatia.jl
- Interior-point method for nuclear norm approximation with application to system identification
- DSDP5
- CHOMPACK
- OBOE
- SMCP
- CVXMOD
- OPT++
- ECOS
- Eigentaste
- CVXPY
- ABF++
- CRFsuite
- pystruct
- Jmol
- SageTeX
- Tachyon
- PyOpt: a python-based object-oriented framework for nonlinear constrained optimization
- POEM
- CTFFIND
- EMPIAR
- SnapVX
- GPkit
- CVXGEN: a code generator for embedded convex optimization
- MISVM
- GraKeL
- graphkernels
- GraSPy
- CHIME
- cisTEM
- CLA
- DoubleFloats.jl
- OPFSDR
- Constrained sparse Galerkin regression
- Mesh adaptive direct search with second directional derivative-based Hessian update
- NetworKit
- MSES
- alfonso
- DDS
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- PyPortfolioOpt
- BioSpaun
- Improved statistical models for limited datasets in uncertainty quantification using stochastic collocation
- Selected applications of convex optimization
- A moving balls approximation method for a class of smooth constrained minimization problems
- Hypatia.jl
- SHYqp
- Alpaqa
- Tenscalc
- Poly6
- Simultaneous nonlinear model predictive control and state estimation
- Efficient evaluation of scaled proximal operators
- Pystruct-learning structured prediction in Python
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
- Thermodynamic implementations of quantum processes
- Logarithmic barriers for sparse matrix cones
- SnapVX: a network-based convex optimization solver
- Numerical methods with Sage
- Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction
- Optimal transport in full-waveform inversion: analysis and practice of the multidimensional Kantorovich-Rubinstein norm
- Computing large market equilibria using abstractions
- Binary classification with ambiguous training data
- Admissibility in Probabilistic Argumentation
- Conic programming: infeasibility certificates and projective geometry
- Critical behaviour in charging of electric vehicles
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- Matrix-free convex optimization modeling
- A Lipschitz Matrix for Parameter Reduction in Computational Science
- PRESAS: Block‐structured preconditioning of iterative solvers within a primal active‐set method for fast model predictive control
- Linear programming with nonparametric penalty programs and iterated thresholding
- An algorithmic exploration of the existence of high-order summation by parts operators with diagonal norm
- On PAC-Bayesian bounds for random forests
- Subordination methods for free deconvolution
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- A formulation of a matrix sparsity approach for the quantum ordered search algorithm
- Mesh adaptive direct search with simplicial Hessian update
This page was built for software: CVXOPT
