Results 1 to 10 of about 10,446 (263)
On Analog of Fourier Transform in Interior of the Light Cone [PDF]
Abstract and Applied Analysis, 2014 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
New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization [PDF]
Yugoslav Journal of Operations Research, 2018 We present a full Nesterov-Todd (NT) step infeasible interior-point algorithm for second-order cone optimization based on a different way to calculate feasibility direction. In each iteration of the algorithm we use the largest possible barrier parameter
Kheirfam Behrouz
doaj +4 more sources
Interiors of completely positive cones [PDF]
Journal of Global Optimization, 2015 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.
Zhou, Anwa, Fan, Jinyan
openaire +2 more sources
Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones [PDF]
SIAM Journal on Optimization, 2006 We establish polynomial-time convergence of infeasible-interior-point methods for conic programs over symmetric cones using a wide neighborhood of the central path. The convergence is shown for a commutative family of search directions used in Schmieta and Alizadeh [Math. Program., 96 (2003), pp. 409-438]. Monteiro and Zhang [Math. Program., 81 (1998),
Yang, Ximei, Liu, Hongwei, Zhang, Yinkui
openaire +2 more sources
Interior points of the completely positive cone [PDF]
The Electronic Journal of Linear Algebra, 2008 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]
Sahand Communications in Mathematical Analysis, 2019 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
Black hole state dependence as a single parameter
Journal of High Energy Physics, 2020 It has previously been proposed that the black hole interior of typical state large black holes in AdS can be described using state-dependent operators. We investigate the possibility that the interior can be described by explicit time dependence, which ...
Rik van Breukelen
doaj +1 more source
Strict Contractive Conditions and Common Fixed Point Theorems in Cone Metric Spaces
Fixed Point Theory and Applications, 2009 A lot of authors have proved various common fixed-point results for pairs of self-mappings under strict contractive conditions in metric spaces. In the case of cone metric spaces, fixed point results are usually proved under assumption that the cone is ...
Z. Kadelburg +2 more
doaj +2 more sources
An Algebraic-Based Primal–Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization
Computation, 2023 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.
Karima Tamsaouete, Baha Alzalg
doaj +1 more source
A primal–dual interior point method for a novel type-2 second order cone optimization
Results in Control and Optimization, 2021 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.
Md Sarowar Morshed +2 more
doaj +1 more source