On Analog of Fourier Transform in Interior of the Light Cone [PDF]
We introduce an analog of Fourier transform Fhρ in interior of light cone that commutes with the action of the Lorentz group. We describe some properties of Fhρ, namely, its action on pseudoradial functions and functions being products of pseudoradial ...
Tatyana Shtepina
doaj +3 more sources
Exact Interior Reconstruction with Cone-Beam CT [PDF]
Using the backprojection filtration (BPF) and filtered backprojection (FBP) approaches, respectively, we prove that with cone-beam CT the interior problem can be exactly solved by analytic continuation.
Yangbo Ye, Hengyong Yu, Ge Wang
doaj +3 more sources
An Algebraic-Based Primal–Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization
In rotated quadratic cone programming problems, we minimize a linear objective function over the intersection of an affine linear manifold with the Cartesian product of rotated quadratic cones.
Baha Alzalg, Alzalg Baha
exaly +3 more sources
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization [PDF]
AbstractA new primal-dual interior-point algorithm applicable to nonsymmetric conic optimization is proposed. It is a generalization of the famous algorithm suggested by Nesterov and Todd for the symmetric conic case, and uses primal-dual scalings for nonsymmetric cones proposed by Tunçel.
Joachim Dahl, Erling D Andersen
exaly +3 more sources
A primal–dual interior point method for a novel type-2 second order cone optimization
In this paper, we define a new, special second order cone as a type-k second order cone. We focus on the case of k=2, which can be viewed as a second order conic optimization (SOCO) problem with an additional complicating variable.
+2 more
exaly +3 more sources
Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones
Optimization problems with second-order cone constraints (SOCs) can be solved efficiently by interior point methods. In order for some of these methods to get started or to converge faster, it is important to have an initial feasible point or near ...
Anna Weigandt +2 more
doaj +5 more sources
Interiors of completely positive cones [PDF]
A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone. A semidefinite algorithm is proposed for checking interiors of the CP cone, and its properties are studied.
Anwa Zhou, Jinyan Fan
openaire +2 more sources
Interior points of the completely positive cone [PDF]
A matrix A is called completely positive if it can be decomposed as A = BB^T with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone. We provide a characterization of the interior of this cone as well as of its dual.
Dür, Mirjam, Still, Georg
openaire +3 more sources
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs [PDF]
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and ...
Ali Nakhaei Amroudi +2 more
doaj +1 more source
Probing the bubble interior with entanglement entropy and bulk-cone singularities
In the thin wall approximation, we study a class of asymptotically AdS black holes which contain a spherically symmetric vacuum bubble with a different (positive or negative) cosmological constant.
Roberto Auzzi +4 more
doaj +3 more sources

