The following pages link to SCS (Q28501):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755) (← links)
- Relaxation methods for navigation satellites set optimization (Q828566) (← links)
- Certifying numerical estimates of spectral gaps (Q1647864) (← links)
- Optimal transport over nonlinear systems via infinitesimal generators on graphs (Q1728239) (← links)
- A survey on conic relaxations of optimal power flow problem (Q2023908) (← links)
- Tax-aware portfolio construction via convex optimization (Q2031994) (← links)
- A distributed algorithm for high-dimension convex quadratically constrained quadratic programs (Q2057223) (← links)
- Efficient semidefinite programming with approximate ADMM (Q2073055) (← links)
- Finding unstable periodic orbits: a hybrid approach with polynomial optimization (Q2077605) (← links)
- Imitation learning of stabilizing policies for nonlinear systems (Q2095315) (← links)
- On a primal-dual Newton proximal method for convex quadratic programs (Q2114815) (← links)
- Proportional-integral projected gradient method for conic optimization (Q2151872) (← links)
- Bounds-constrained polynomial approximation using the Bernstein basis (Q2168063) (← links)
- Distance geometry and data science (Q2192022) (← links)
- Optimal rates for estimation of two-dimensional totally positive distributions (Q2192313) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- Estimation of Monge matrices (Q2203631) (← links)
- Optimal perturbations for nonlinear systems using graph-based optimal transport (Q2205840) (← links)
- Reconstructing manifolds from truncations of spectral triples (Q2219921) (← links)
- COSMO: a conic operator splitting method for convex conic problems (Q2231337) (← links)
- Automatic repair of convex optimization problems (Q2245690) (← links)
- Infeasibility detection in the alternating direction method of multipliers for convex optimization (Q2275323) (← links)
- Solution refinement at regular points of conic problems (Q2282811) (← links)
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs (Q2297655) (← links)
- A convex optimization approach to radiation treatment planning with dose constraints (Q2327923) (← links)
- \(\Aut(\mathbb{F}_5)\) has property \((T)\) (Q2332927) (← links)
- Stochastic matrix-free equilibration (Q2359773) (← links)
- Perspective functions: proximal calculus and applications in high-dimensional statistics (Q2408636) (← links)
- Linear convergence of first order methods for non-strongly convex optimization (Q2414900) (← links)
- Computation of the maximum likelihood estimator in low-rank factor analysis (Q2425172) (← links)
- On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\) (Q2662017) (← links)
- A comparison of optimization solvers for log binomial regression including conic programming (Q2666995) (← links)
- Anderson accelerating the preconditioned modulus approach for linear complementarity problems on second-order cones (Q2674582) (← links)
- Efficient differentiable quadratic programming layers: an ADMM approach (Q2696912) (← links)
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization (Q2810900) (← links)
- Matrix-Free Convex Optimization Modeling (Q2957708) (← links)
- Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)
- Low-Rank Matrix Iteration Using Polynomial-Filtered Subspace Extraction (Q3300851) (← links)
- Non-Convex Global Minimization and False Discovery Rate Control for the TREX (Q3391128) (← links)
- GMRES-Accelerated ADMM for Quadratic Objectives (Q4554067) (← links)
- (Q4614130) (← links)
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming (Q4632034) (← links)
- An ADMM-based interior-point method for large-scale linear programming (Q4999335) (← links)
- Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem (Q5010047) (← links)
- Computing Large Market Equilibria Using Abstractions (Q5031015) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Scenario-Based Verification of Uncertain MDPs (Q5039513) (← links)
- Maximum A Posteriori Inference of Random Dot Product Graphs via Conic Programming (Q5043284) (← links)
