SCS

swMATH16632MaRDI QIDQ28501FDOQ28501

Author name not available (Why is that?)

Source code repository: https://github.com/cvxgrp/scs

Cited In (68)

• Computing large market equilibria using abstractions
• Maximum a posteriori inference of random dot product graphs via conic programming
• Coverage path planning for 3D terrain with constraints on trajectory curvature based on second-order cone programming
• Implementation of a projection and rescaling algorithm for second-order conic feasibility problems
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
• Title not available (Why is that?)
• Operator splitting for a homogeneous embedding of the linear complementarity problem
• Approximate modularity: Kalton's constant is not smaller than 3
• An optimal-storage approach to semidefinite programming using approximate complementarity
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Bounds on heat transfer for Bénard-Marangoni convection at infinite Prandtl number
• Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
• Alfonso: Matlab Package for Nonsymmetric Conic Optimization
• Relaxation methods for navigation satellites set optimization
• On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\)
• An Approximation Scheme for Distributionally Robust Nonlinear Optimization
• FANOK: knockoffs in linear time
• Infeasibility detection in the alternating direction method of multipliers for convex optimization
• CVXPY: a Python-embedded modeling language for convex optimization
• Stochastic matrix-free equilibration
• Optimal perturbations for nonlinear systems using graph-based optimal transport
• Anderson Accelerated Douglas--Rachford Splitting
• Convergence of anisotropic mesh adaptation via metric optimization
• Scenario-based verification of uncertain MDPs
• \(\Aut(\mathbb{F}_5)\) has property \((T)\)
• Matrix-free convex optimization modeling
• Automatic repair of convex optimization problems
• A survey on conic relaxations of optimal power flow problem
• Distance geometry and data science
• Reconstructing manifolds from truncations of spectral triples
• Efficient differentiable quadratic programming layers: an ADMM approach
• Tax-aware portfolio construction via convex optimization
• Linear convergence of first order methods for non-strongly convex optimization
• GMRES-accelerated ADMM for quadratic objectives
• Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
• Perspective functions: proximal calculus and applications in high-dimensional statistics
• Certifying numerical estimates of spectral gaps
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• Optimal transport over nonlinear systems via infinitesimal generators on graphs
• Solving Natural Conic Formulations with Hypatia.jl
• Proportional-integral projected gradient method for conic optimization
• Computation of the maximum likelihood estimator in low-rank factor analysis
• A convex optimization approach to radiation treatment planning with dose constraints
• Extended formulations in mixed-integer convex programming
• Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
• A comparison of optimization solvers for log binomial regression including conic programming
• Stochastic block projection algorithms with extrapolation for convex feasibility problems
• Solution refinement at regular points of conic problems
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• OSQP: an operator splitting solver for quadratic programs
• An ADMM-based interior-point method for large-scale linear programming
• Bounds-constrained polynomial approximation using the Bernstein basis
• Non-Convex Global Minimization and False Discovery Rate Control for the TREX
• A distributed algorithm for high-dimension convex quadratically constrained quadratic programs
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones
• On the robustness and scalability of semidefinite relaxation for optimal power flow problems
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
• Low-rank matrix iteration using polynomial-filtered subspace extraction
• Outer approximation with conic certificates for mixed-integer convex problems
• Optimal rates for estimation of two-dimensional totally positive distributions
• COSMO: a conic operator splitting method for convex conic problems
• Efficient semidefinite programming with approximate ADMM
• Finding unstable periodic orbits: a hybrid approach with polynomial optimization
• On a primal-dual Newton proximal method for convex quadratic programs
• Estimation of Monge matrices
• Imitation learning of stabilizing policies for nonlinear systems

This page was built for software: SCS