We propose the algorithm that solves the symmetric cone programs (SCPs) by iteratively
calling the projection and rescaling methods the algorithms for solving exceptional cases of …

This paper documents a computational implementation of a projection and rescaling
algorithm for finding most interior solutions to the pair of feasibility problems find x∈ L∩ R+ …

We propose a new variant of Chubanov's method for solving the feasibility problem over the
symmetric cone by extending Roos's method (Optim Methods Softw 33 (1): 26–44, 2018) of …

This paper documents a computational implementation of a projection and rescaling
algorithm for solving one of the alternative feasibility problems find x∈ L∩ Ω or find x^∈ …

We point out that Chubanov's oracle-based algorithm for linear programming [5] can be
applied almost as it is to linear semi-infinite programming (LSIP). In this note, we describe …

Существует большое множество вещественных симметричных матриц, элементами
которых служат линейные функции нескольких переменных, причем каждая матрица …

There exists a large set of real symmetric matrices whose entries are linear functions in
several variables such that each matrix in this set is definite at some point, that is, the matrix …

Semidefinite optimization problems (SDPs) have a wide range of applications in convex
optimization, combinatorial and nonconvex optimizations and control theory. The …

Using an efficient algorithmic implementation of Caratheodory's theorem, we propose three
enhanced versions of the projection and rescaling algorithm's basic procedures. Each of …

We offer a unified treatment of distinct measures of well-posedness for homogeneous conic
systems. To that end, we introduce a distance to infeasibility based entirely on geometric …