# An Algorithm for Nonsymmetric Conic Optimization Inspired by MOSEK

arXiv: https://arxiv.org/abs/2003.01546 · HTML: https://mlsanity.com/paper/2003.01546/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Mar 2020.

## Built on by (most cited first, 1 of 1)

- [Inference for Probabilistic Dependency Graphs](https://mlsanity.com/paper/2311.05580/) (2023)

## Abstract (arXiv)

We analyze the scaling matrix, search direction, and neighborhood used in MOSEK's algorithm for nonsymmetric conic optimization [Dahl and Andersen, 2019]. It is proven that these can be used to compute a near-optimal solution to the homogeneous self-dual model in polynomial time.