We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones derivable from associative algebras. In particular, such analyses are extendible to the cone of positive semidefinite Hermitian matrices with complex and quaternion entries, and to the Lorentz cone. We pro...

Flat panel detector-based cone beam breast CT (CBBCT) can provide 3D image of the scanned breast with 3D isotropic spatial resolution, overcoming the disadvantage of the structure superimposition associated with X-ray projection mammography. It is very difficult for Mammography to detect a small carcinoma (a few millimeters in size) when the tumor is occult or in dense breast. CBBCT featured wi...

Rod modulation of an annular surround can produce brightness contrast in a test field centered at 100 from the fovea. In our research, stimuli originated from a colorimeter that provided 4 primaries in both the circular test and the annular surround fields, and allowed independent modulation of the rods and each of the short (S)-, middle (M)-, and long (L)-wavelength-sensitive cone types. The c...

The paper proposes a simple method to determine the 3-D location and shape parameters of a right circular cone using structured lights. A vital concept in the proposed method is to convert the complex curved stripe pattern into an equivalent, but simpler, linear stripe pattern. The conic surface patch lying between two visible silhouette edges is replaced by the plane defined by the two silhoue...

Here we formulate second-order cone programs (SOCPs) for synthesizing complex weights for far-field directional (single-point mainbeam) patterns for narrowband arrays. These formulations, while constructed here with the uniform circular array (UCA) in mind, are actually quite general in that they control the arbitrary-pol sidelobe level (SLL) and co-pol SNR loss relative to ideal by minimizing ...

In this study, a limit equilibrium method has been developed that satisfies all conditions of equilibrium and assumes circular slip surfaces. All force and moment equilibrium equations are employed without using simplification assumptions. A non-linear optimization technique is used to solve the system of equations with the corresponding constraints. The proposed method is capable to determine ...

We consider a p-norm linear discrimination model that generalizes the model of Bennett and Mangasarian (1992) and reduces to a linear programming problem with p-order cone constraints. The proposed approach for handling linear programming problems with p-order cone constraints is based on reformulation of p-order cone optimization problems as second order cone programming (SOCP) problems when p...

In the conic formulation of a convex optimization problem the constraints are expressed as linear inequalities with respect to a possibly non-polyhedral convex cone. This makes it possible to formulate elegant extensions of interior-point methods for linear programming to general nonlinear convex optimization. Recent research on cone programming algorithms has particularly focused on three conv...

A matrix A is called completely positive if it can be decomposed as A = BBT with an entrywise nonnegative matrix B. The set of all such matrices is a convex cone which plays a role in certain optimization problems. A characterization of the interior of this cone is provided.

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...