Cover Image

Clarabel: An interior-point solver for conic programs with quadratic objectives

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goulart, Paul J., Chen, Yuwen
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A warmstarting technique for general conic optimization in interior point methods
by: Chen, Yuwen, et al.
Published: (2025)

CuClarabel: GPU Acceleration for a Conic Optimization Solver
by: Chen, Yuwen, et al.
Published: (2024)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
by: Bertoncini, Jeremy, et al.
Published: (2025)

A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
by: Ek, David, et al.
Published: (2020)

Local near-quadratic convergence of Riemannian interior point methods
by: Obara, Mitsuaki, et al.
Published: (2025)

Differential dynamic programming with stagewise equality and inequality constraints using interior point method
by: Prabhu, Siddharth, et al.
Published: (2024)

A matrix-free interior point continuous trajectory for linearly constrained convex programming
by: Qian, Xun, et al.
Published: (2024)

Superlinear and quadratic convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programming problems
by: Yamakawa, Yuya
Published: (2022)

A sparse ADMM-based solver for linear MPC subject to terminal quadratic constraint
by: Krupa, Pablo, et al.
Published: (2021)

Tight semidefinite programming relaxations for sparse box-constrained quadratic programs
by: Khajavirad, Aida
Published: (2026)

On semidefinite descriptions for convex hulls of quadratic programs
by: Wang, Alex L., et al.
Published: (2024)

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

Sensitivity analysis for mixed binary quadratic programming
by: Cifuentes, Diego, et al.
Published: (2023)

Stochastic interior-point methods for smooth conic optimization with applications
by: He, Chuan, et al.
Published: (2024)

Model-free stochastic linear quadratic design by semidefinite programming
by: Guo, Jing, et al.
Published: (2024)

Curvature batching gives single-exponential integer quadratic programming
by: Ari, Cinar, et al.
Published: (2026)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)

Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)

Q-quadratic convergence of the centralized circumcentered-reflection method under a relative interior condition
by: Bello-Cruz, Yunier
Published: (2026)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

Reliably-stabilizing piecewise-affine neural network controllers
by: Fabiani, Filippo, et al.
Published: (2021)

Robust stabilization of polytopic systems via fast and reliable neural network-based approximations
by: Fabiani, Filippo, et al.
Published: (2022)

Parallel splitting method for large-scale quadratic programs
by: Vandelli, Matteo, et al.
Published: (2025)

Provably data-driven projection method for quadratic programming
by: Nguyen, Anh Tuan, et al.
Published: (2025)

Adaptive projected SOR algorithms for nonnegative quadratic programming
by: Miyatake, Yuto, et al.
Published: (2021)

A penalty-interior point method combined with MADS for equality and inequality constrained optimization
by: Audet, Charles, et al.
Published: (2026)

A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
by: Iommazzo, Gabriele, et al.
Published: (2024)

Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
by: Yamakawa, Yuya
Published: (2025)

Fix and Bound: An efficient approach for solving large-scale quadratic programming problems with box constraints
by: Locatelli, Marco, et al.
Published: (2022)

A factorisation-based regularised interior point method using the augmented system
by: Zanetti, Filippo, et al.
Published: (2025)

Data-Driven Performance Guarantees for Parametric Optimization Problems
by: Huang, Jingyi, et al.
Published: (2025)

Linear Controller Design for Chance Constrained Systems
by: Schildbach, Georg, et al.
Published: (2014)

A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity
by: Feng, Fuxiaoyue, et al.
Published: (2024)

Uncertainty relation and the constrained quadratic programming
by: Zhang, Lin, et al.
Published: (2024)

Carleman estimates for degenerate parabolic equations with single interior point degeneracy and its applications
by: Liu, Yuanhang, et al.
Published: (2023)

Recovering sparse DFT from missing signals via interior point method on GPU
by: Kuang, Wei, et al.
Published: (2025)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
by: Chinchilla, Raphael, et al.
Published: (2022)

A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
by: Obara, Mitsuaki, et al.
Published: (2025)