Results 1 to 10 of about 12,379 (256)
AN IMPROVED CHARACTERISATION OF THE INTERIOR OF THE COMPLETELY POSITIVE CONE [PDF]
The Electronic Journal of Linear Algebra, 2010 A symmetric matrix is defined to be completely positive if it allows a factorisation BB(T), where B is an entrywise nonnegative matrix. This set is useful in certain optimisation problems.
Dickinson, Peter J. C.
core +5 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.
Georg Still +6 more
core +4 more sources
Exact Interior Reconstruction with Cone-Beam CT [PDF]
International Journal of Biomedical Imaging, 2007 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.
Hengyong Yu, Ge Wang, Yangbo Ye
core +4 more sources
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
core +4 more sources
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization [PDF]
Mathematical Programming, 2021 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 New Inexact Non-Interior Continuation Algorithm for Second-Order Cone Programming
2009 International Joint Conference on Computational Sciences and Optimization, 2019 Second-order cone programming has received considerable attention in the past decades because of its wide range of applications. Non-interior continuation method is one of the most popular and efficient methods for solving second-order cone programming ...
Fang, Liang
core +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.
Anwa Zhou, Jinyan Fan
openaire +2 more sources
Primal-Dual Interior-Point Methods for Self-Scaled Cones [PDF]
SIAM Journal on Optimization, 1998 Summary: We continue the development of a theoretical foundation for efficient primal-dual interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled [see \textit{Yu. E. Nesterov} and \textit{M. J. Todd}, Math. Oper. Res. 22, 1-42 (1997; Zbl 0871.90064)].
NESTEROV , Yurii, TODD , Michael
openaire +3 more sources
A Minimal Lamination of the Interior of a Positive Cone with Quadratic Curvature Blowup [PDF]
The Journal of Geometric Analysis, 2014 A few typos fixed.
Breiner, Christine, Kleene, Stephen J.
openaire +2 more sources
A globally convergent non-interior point algorithm with full Newton step for second-order cone programming [PDF]
, 2009 summary:A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a ...
Zhao, Qi +7 more
core +3 more sources