REVIEW 17 cited by
Clarabel: An interior-point solver for conic programs with quadratic objectives
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present a general-purpose interior-point solver for convex optimization problems with conic constraints. Our method is based on a homogeneous embedding method originally developed for general monotone complementarity problems and more recently applied to operator splitting methods, and here specialized to an interior-point method for problems with quadratic objectives. We allow for a variety of standard symmetric and non-symmetric cones, and provide support for chordal decomposition methods in the case of semidefinite cones. We describe the implementation of this method in the open-source solver Clarabel, and provide a detailed numerical evaluation of its performance versus several state-of-the-art solvers on a wide range of standard benchmarks problems. Clarabel is faster and more robust than competing commercial and open-source solvers across a range of test sets, with a particularly large performance advantage for problems with quadratic objectives. Clarabel is currently distributed as a standard solver for the Python CVXPY optimization suite.
Forward citations
Cited by 17 Pith papers
-
Estimating Dynamic Marginal Policy Effects under Sequential Unconfoundedness
Parametric nonconvex problems can be approximated by a min of quasiconvex (convex∘monotonic) surrogates and solved via parallel convex optimization, trained mainly from function evaluations.
-
Near-optimal Delta-convex Estimation of Lipschitz Functions
The DCF estimator reaches the near-minimax rate n^{-2/(2+d_*)} for Lipschitz regression under squared loss, adapting to intrinsic dimension without knowing the Lipschitz constant.
-
Gradient Methods with Online Scaling Part I. Theoretical Foundations
Online scaled gradient methods adapt matrix step sizes via online learning, match the best fixed step size asymptotically, and achieve non-asymptotic superlinear convergence on smooth strongly convex problems.
-
New Understandings and Computation on Augmented Lagrangian Methods for Low-Rank Semidefinite Programming
Augmented Lagrangian subproblems inherit low-rankness, strict complementarity, and quadratic growth from a primal simple SDP, making Burer-Monteiro gradient descent converge linearly.
-
Passively Safe Convex Guidance for Cislunar Rendezvous and Proximity Operations
Purely convex second-order cone programs can design passively safe approach, arrival, and abort maneuvers for cislunar rendezvous, verified by Monte Carlo simulation.
-
Input-to-state Stable Approximate Nonlinear Model Predictive Control with Realtime Feasibility
A precomputed ISS-CLF/robust-CBF pair yields a real-time QP that approximates robust NMPC with proven ISS and constraint satisfaction for nonlinear systems.
-
FullPASS: Geometry Optimization for Full-Duplex Pinching-Antenna Systems
A dual-waveguide pinching-antenna full-duplex system selects transmit and receive elements to suppress self-interference, reaching within 0.95% of exhaustive-search spectral efficiency.
-
GraspADMM: Improving Dexterous Grasp Synthesis via ADMM Optimization
Decoupling target object contact points from hand contact points in an ADMM loop improves simulated dexterous grasp success by ~15 absolute points over Dexonomy while keeping penetration at zero.
-
Robust Convex Model Predictive Control with collision avoidance guarantees for robot manipulators
A convex model predictive controller with a flexible safety tube and learned collision-free corridors achieves fast, robust, collision-free motion for robot manipulators under model uncertainty.
-
A Tax-Efficient Model Predictive Control Policy for Retirement Funding
A model predictive control policy that solves a convex optimization problem each year produces larger simulated inheritances than the standard 4% rule while keeping consumption at target.
-
HPR-QP: A dual Halpern Peaceman-Rachford method for solving large-scale convex composite quadratic programming
HPR-QP solves large-scale convex composite quadratic programs with a dual Halpern Peaceman-Rachford iteration on the restricted Wolfe dual, obtaining O(1/k) KKT residual and strong GPU benchmark results.
-
Iteratively Saturated Kalman Filtering
A robust Kalman filter that iteratively saturates measurement innovations and deviations from the predicted state, derived as a scaled gradient method for a Huber-type MAP problem.
-
PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow
PGLearn provides a large open-source dataset collection and toolkit with AC, DC, and SOC-OPF primal and dual solutions, time-series data for large grids, and benchmarking tools for ML-based OPF methods.
-
Favorability of Loss Landscape with Weight Decay Requires Both Large Overparametrization and Initialization
Weight-decay-regularized two-layer ReLU networks need width exponential in the number of samples for a benign loss landscape, and small initialization can still converge to spurious minima.
-
Automatic Generation of Explicit Quadratic Programming Solvers
CVXPYgen can now generate explicit piecewise-affine QP solvers from CVXPY models, achieving microsecond-scale solve times for small parametric problems.
-
An Iterative Geometric Approach to Optimizing Separating Hyperplanes
Starting from any separating hyperplane, the algorithm repeatedly rotates it toward the max-margin separator of the nearest points, preserving separation and increasing margin until the global optimum is reached (thou...
-
An Overview of GPU-based First-Order Methods for Linear Programming and Extensions
A survey of GPU-based first-order LP solvers focusing on cuPDLP, its PDHG core, theory, benchmarks, and extensions to QP, SDP, and conic programming.
Discussion (0). Continue with ORCID to comment.