REVIEW 33 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 33 Pith papers
-
Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming
A path-following smoothing Newton method for symmetric cone programming achieves O(sqrt(nu) ln(1/eps)) iteration complexity via a newly introduced self-concordant convex-concave reduced SBAL function that induces a ce...
-
Certified Gradient-Based Contact-Rich Manipulation via Smoothing-Error Reachable Tubes
A certified gradient-based method for contact-rich manipulation that quantifies smoothing-induced errors via set-valued discrepancies and incorporates them into analytical reachable sets for robust affine feedback policies.
-
Learning Approximate Solutions to Multiparametric Generalized Nash Equilibrium Problems
A learning approach trains neural networks to approximate solutions of multiparametric GNEPs using NI gap loss with value surrogates, achieving large speedups and providing new existence conditions for continuous selections.
-
Active Learning for Stochastic Contextual Linear Bandits
Active context sampling algorithm for contextual linear bandits achieves instance-dependent guarantees improving over minimax rate by up to sqrt(d) and reduces samples needed in empirical tasks.
-
Reachability-Augmented Dual Dynamic Programming for Optimal Path Parameterization
RDDP augments classical dual dynamic programming with OPP-specific backward reachable sets to deliver global optimality certificates and faster computation for both convex and non-convex optimal path parameterization.
-
Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability
A new stochastic differential dynamic programming method optimizes coupled trajectory design and orbit determination under partial observability, producing navigation-aware solutions with lower fuel consumption than d...
-
Stochastic Differential Dynamic Programming for Trajectory Optimization under Partial Observability
Introduces a stochastic DDP algorithm that optimizes nominal controls and feedback gains for belief-state trajectory problems under partial observability without relying on the separation principle.
-
Beyond De Prado and Cotton: Hierarchical and Iterative Methods for General Mean-Variance Portfolios
Proposes HRP-μ, HRP-Σμ, and CRISP as signal-aware extensions to HRP and Cotton-style regularization for mean-variance portfolios, with Monte Carlo results showing outperformance over baselines.
-
Estimating Dynamic Marginal Policy Effects under Sequential Unconfoundedness
Dynamic marginal policy effects can be identified through reduced-form expressions and estimated with a doubly robust method under sequential unconfoundedness, avoiding full state observation and curse of horizon.
-
\texttt{DR-DAQP}: An Hybrid Operator Splitting and Active-Set Solver for Affine Variational Inequalities
DR-DAQP is a hybrid solver using operator splitting and active-set methods that solves affine variational inequalities exactly in finite time under specified conditions and runs up to two orders of magnitude faster th...
-
Learning Dynamic Rope Manipulation Using Task-Level Iterative Learning Control
Task-level ILC learns flying knot rope manipulation from one demo, achieving 100% success within 10 trials on 7 rope types with 2-5 trial transfers.
-
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.
-
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.
-
A Fast Convergent Algorithm for Solving Non-convex Partially-Decoupled Generalized Nash Equilibrium Problems
FALCON algorithm solves non-convex partially-decoupled GNEPs via SCP and potential games, claiming global convergence to open-loop Nash equilibria under mild assumptions.
-
LEAF: A Learning-Enabled ADMM Framework for Accelerated Convex Optimization
LEAF learns a scalar Moreau envelope via ICNN to create MEL-ADMM and sMEL-ADMM variants that retain ADMM convergence rates while cutting per-iteration cost, with claimed order-of-magnitude empirical speedups.
-
Mixed-Precision GPU Acceleration for Large-Scale Minimum Enclosing Ball Problems
A mixed-precision ripALM method on GPUs solves large-scale minimum enclosing ball problems faster than CPU geometric software and general conic solvers while maintaining high accuracy.
-
HUANet: Hard-Constrained Unrolled ADMM for Constrained Convex Optimization
HUANet unrolls ADMM iterations into a trainable network that enforces equality constraints exactly via a differentiable correction layer and adds soft first-order optimality conditions during training.
-
A Bayesian Perspective on the Data-Driven LQR
Bayesian ddLQR adds posterior uncertainty to the design, decomposing expected cost into certainty-equivalence plus variance terms, proving indirect-direct equivalence, and producing a data-length-independent SDP.
-
Parametric Nonconvex Optimization via Convex Surrogates
A surrogate for parametric nonconvex optimization is constructed as the minimum of convex-monotonic function compositions and solved via parallel convex optimization, with a proof-of-concept on path tracking.
-
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.
-
Estimating Dynamic Marginal Policy Effects under Sequential Unconfoundedness
Develops tractable reduced-form identification and a doubly robust estimator for dynamic marginal policy effects that avoids full state observation and exponential horizon curse.
-
Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming
Establishes O(√ν ln(1/ε)) iteration complexity for path-following smoothing Newton methods on symmetric cone programs via a new self-concordant reduced barrier augmented Lagrangian function and associated central path...
-
Acceleration of Moment Bound Optimization for Stochastic Chemical Reactions Using Reaction-wise Sparsity of Moment Equations
A reaction-wise sparsity decomposition reduces the size of semidefinite constraints in moment bounding for stochastic chemical kinetics, lowering computational cost while retaining useful bounds.
-
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.
-
Presolving for GPU-Accelerated First-Order LP Solvers
A set of simple low-cost presolve rules captures most of Gurobi's reduction and yields end-to-end speedups for GPU first-order LP solvers.
-
On the Practical Implementation of a Sequential Quadratic Programming Algorithm for Nonconvex Sum-of-squares Problems
A filter line search SQP algorithm reduces iterations and computation time for nonconvex SOS programs compared to prior methods.
-
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...
-
Integrated Lander-Propulsion-GNC Framework for Autonomous Lunar Powered Descent
An integrated lander-propulsion-GNC framework using successive convexification on a test vehicle achieves sub-50-meter landing precision in Monte Carlo simulations under perturbations.
-
A Note on Optimal Product Pricing
Optimal product pricing with elasticities is formulated as convex-concave maximization and solved via convex-concave procedure, quadratic programs, or nonlinear optimization, with numerical tests indicating the soluti...
-
Revisiting Gaussian genuine entanglement witnesses with modern software
Convex optimization formulations and an analytical symplectic trace expression are introduced to reconstruct physical Gaussian covariance matrices and witness genuine multipartite entanglement from experimental data.
-
Asymmetry PRISM: A CPU/GPU Portfolio Optimization Engine for Deadline-Bounded Institutional Rebalancing
Asymmetry PRISM-CPU achieves 4.5x-24.1x speedups over reference solvers on N=100-2000 problems and GPU completes all 500 accounts in 109.5s where OSQP completes 4.
Discussion (0). Sign in to comment.