CVXOPT

swMATH4321MaRDI QIDQ16500FDOQ16500

Author name not available (Why is that?)

Cited In (68)

• Admissibility in Probabilistic Argumentation
• 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
• Passive Nonlinear Dendritic Interactions as a Computational Resource in Spiking Neural Networks
• A formulation of a matrix sparsity approach for the quantum ordered search algorithm
• Computing Large Market Equilibria Using Abstractions
• Title not available (Why is that?)
• 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
• A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
• Binary classification with ambiguous training data
• On the measurable chromatic number of a space of dimension \(n \leq 24\)
• Conic programming: infeasibility certificates and projective geometry
• 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
• Safe autonomy under perception uncertainty using chance-constrained temporal logic
• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
• 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
• Tight Bounds on Online Checkpointing Algorithms
• Incorporation of flexible objectives and time-linked simulation with flux balance analysis
• 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
• An algorithmic exploration of the existence of high-order summation by parts operators with diagonal norm
• Cooperation, conformity, and the coevolutionary problem of trait associations
• On PAC-Bayesian bounds for random forests
• Subordination methods for free deconvolution
• Inexact proximal Newton methods for self-concordant functions
• 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
• Shape Optimization with Nonsmooth Cost Functions: From Theory to Numerics
• Solving Natural Conic Formulations with Hypatia.jl
• Title not available (Why is that?)
• Matrix-Free Convex Optimization Modeling
• Optimal transport in full-waveform inversion: analysis and practice of the multidimensional Kantorovich–Rubinstein norm
• PyOpt: a python-based object-oriented framework for nonlinear constrained optimization
• CVXGEN: a code generator for embedded convex optimization
• A Conservative Mesh-Free Scheme and Generalized Framework for Conservation Laws
• Constrained sparse Galerkin regression
• Mesh adaptive direct search with second directional derivative-based Hessian update
• SnapVX: A Network-Based Convex Optimization Solver
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
• Mesh adaptive direct search with simplicial Hessian update
• Multiple-instance learning from distributions
• Improved statistical models for limited datasets in uncertainty quantification using stochastic collocation
• Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
• Balancing Traffic Load Using One-Turn Rectilinear Routing
• Selected applications of convex optimization
• Lipschitz regularization for fracture: the Lip-field approach
• Bregman primal-dual first-order method and application to sparse semidefinite programming
• A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems
• A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
• Simultaneous nonlinear model predictive control and state estimation
• Efficient evaluation of scaled proximal operators
• Detecting and Repairing Arbitrage in Traded Option Prices
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• 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
• Numerical methods with Sage
• Critical behavior and universality classes for an algorithmic phase transition in sparse reconstruction

This page was built for software: CVXOPT