A new extension of Chubanov's method to symmetric cones
From MaRDI portal
Publication:6126666
DOI10.1007/s10107-023-01995-9arXiv2110.09854MaRDI QIDQ6126666
Shin-ichi Kanoh, Akiko Yoshise
Publication date: 9 April 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09854
Cites Work
- A strongly polynomial algorithm for linear systems having a binary solution
- A polynomial projection algorithm for linear feasibility problems
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Solving conic systems via projection and rescaling
- An extension of Chubanov's algorithm to symmetric cones
- On an algebraic generalization of the quantum mechanical formalism
- An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
- A Primal–Dual Smooth Perceptron–von Neumann Algorithm
- A Smooth Perceptron Algorithm
- An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming
- An improved version of Chubanov's method for solving a homogeneous feasibility problem
- Solving SDP completely with an interior point oracle
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Unnamed Item
- Unnamed Item
- Unnamed Item
