The algorithm of Feldkamp, Davis, and Kress [J. Opt. Soc. Am. A 1, 612-619 (1984)] is a widely used filtered-backprojection algorithm for three-dimensional image reconstruction from cone-beam (CB) projections measured with a circular orbit of the x-ray source. A well-known property of this approximate algorithm is that the integral of the reconstructed image along any axial line orthogonal to t...

A one{to{one relation is established between the nonnegative spectral values of a vector in a primitive symmetric cone and the eigenvalues of its quadratic representation. This result is then exploited to derive similarity relations for vectors with respect to a general symmetric cone. For two positive deenite matrices X and Y , the square of the spectral geometric mean is similar to the matrix...

Two lectins, wheat germ agglutinin (WGA) and peanut agglutinin (PNA), were used to compare domains within the interphotoreceptor matrices (IPM) of the cat and monkey, two species where the morphological relationship between the retinal pigment epithelium (RPE) and photoreceptors is distinctly different. In the monkey, PNA labeling was heaviest over the cone outer segments and a discrete region ...

In this paper we consider l0 regularized convex cone programming problems. In particular, we first propose an iterative hard thresholding (IHT) method and its variant for solving l0 regularized box constrained convex programming. We show that the sequence generated by these methods converges to a local minimizer. Also, we establish the iteration complexity of the IHT method for finding an -loca...

A recent series of papers has examined the extension of disjunctive-programming techniques to mixed-integer second-order-cone programming. For example, it has been shown—by several authors using different techniques—that the convex hull of the intersection of an ellipsoid, E , and a split disjunction, (l−xj)(xj−u) ≤ 0 with l < u, equals the intersection of E with an additional second-order-cone...

In multi-circular synthetic aperture radar (MCSAR) mode, resolution and sidelobes are two important parameters to consider when representing imaging quality, as in other SAR imaging modes. In this paper, three-dimensional (3-D) resolution and cone-shaped sidelobes of MCSAR are analyzed for a point target in the scene center under the Nyquist sampling criterion. The results of the analysis show ...

The objective of this work is to study weak infeasibility in second order cone programming. For this purpose, we consider a relaxation sequence of feasibility problems that mostly preserve the feasibility status of the original problem. This is used to show that for a given weakly infeasible problem at most m directions are needed to approach the cone, where m is the number of Lorentz cones. We...

In a second-order cone program (SOCP) a linear function is minimized over the intersection of an a ne set and the product of second-order (quadratic) cones. SOCPs are nonlinear convex problems that include linear and (convex) quadratic programs as special cases, but are less general than semide nite programs (SDPs). Several e cient primal-dual interior-point methods for SOCP have been developed...

This paper presents abstracts (short outlines) of recent papers related to semidefinite programming. The papers are grouped by subject. Many of my own papers deal with SDP but may not included here yet. They are available at http://orion.math.uwaterloo.ca:80/ ̃hwolkowi/henry/reports/ABSTRACTS.html

1 Overview We survey the basic notions of cones and cone-LP and give several examples mostly related to semidefinite programming. The linear and semidefinite programming problems are formulated as follows: Let c ∈ n and b ∈ m ,A ∈ n×m with rows a i ∈