SCS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An optimal-storage approach to semidefinite programming using approximate complementarity
- Computing large market equilibria using abstractions
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Bounds on heat transfer for Bénard-Marangoni convection at infinite Prandtl number
- Relaxation methods for navigation satellites set optimization
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Maximum a posteriori inference of random dot product graphs via conic programming
- On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\)
- JAXopt
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- FANOK: knockoffs in linear time
- 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
- Coverage path planning for 3D terrain with constraints on trajectory curvature based on second-order cone programming
- Convergence of anisotropic mesh adaptation via metric optimization
- \(\Aut(\mathbb{F}_5)\) has property \((T)\)
- Matrix-free convex optimization modeling
- Scenario-based verification of uncertain MDPs
- Automatic repair of convex optimization problems
- A survey on conic relaxations of optimal power flow problem
- Distance geometry and data science
- Implementation of a projection and rescaling algorithm for second-order conic feasibility problems
- Reconstructing manifolds from truncations of spectral triples
- Tax-aware portfolio construction via convex optimization
- Efficient differentiable quadratic programming layers: an ADMM approach
- Linear convergence of first order methods for non-strongly convex optimization
- Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
- Certifying numerical estimates of spectral gaps
- Perspective functions: proximal calculus and applications in high-dimensional statistics
- GMRES-accelerated ADMM for quadratic objectives
- Frank--Wolfe Methods with an Unbounded Feasible Region and Applications to Structured Learning
- scientific article; zbMATH DE number 7306855 (Why is no real title available?)
- Optimal transport over nonlinear systems via infinitesimal generators on graphs
- LDL
- PERUSE
- SDPLIB
- CVXOPT
- GAIO
- VSDP
- CHOMPACK
- CVX
- Mosek
- COL
- SMCP
- SDPLR
- SparseCoLO
- Algorithm 587
- kappalab
- LMBM
- ROI
- PICOS
- NCSOStools
- MProbe
- ECOS
- BENSOLVE
- bamg
- CBLIB
- SDPNAL+
- CVXPY
- Anderson
- JuMP
- BProbe
- CDCS
- QETLAB
- CVXR
- lightning
- Convex.jl
- CVXPortfolio
- FOM
- OSQP
- POGS
- sdpt3r
- EPnP
- SPOTless
- ConRad
- 2EBD-HPE
- CUDAnative.jl
- AbstractAlgebra.jl
- FBstab
- Pajarito
- OPFSDR
- Solver-o-matic
- QPALM
- Celer
- FASTA
- CUDA.jl
- Polyrun
- alfonso
- DDS
- ART3+
- QDLDL
- SuperSCS
- SuperMann
- BLITZ
- UltraNest
- MathOptInterface.jl
This page was built for software: SCS
