In vector optimization with a variable ordering structure the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications it was started to develop a comprehensive theory for these vector optimization problems. Thereby also notions of proper efficiency were generalized to variable ordering structu...

an elliptical tank cross-section is formulated to explore and optimization method, based on a real-coded genetic algorithm to enhance the roll stability limit of a tank vehicle. a shape genetic algorithm optimization problem is applied to minimize the overturning moment imposed on the vehicle due to c.g. height of the liquid load, and lateral acceleration and cargo load shift . the minimization...

Space tensors appear in physics and mechanics, and they are real physical entities. Mathematically, they are tensors in the three-dimensional Euclidean space. In the research of diffusion magnetic resonance imaging, convex optimization problems are formed where higher order positive semi-definite space tensors are involved. In this short paper, we investigate these problems from the viewpoint o...

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...

In this paper we consider a mathematical program with second-order cone complementarity constraints (SOCMPCC). The SOCMPCC generalizes the mathematical program with complementarity constraints (MPCC) in replacing the set of nonnegative reals by a second-order cone. We show that if the SOCMPCC is considered as an optimization problem with convex cone constraints, then Robinson’s constraint quali...

A conventional 3rd generation Computed Tomography (CT) system with a single circular source trajectory is limited in terms of longitudinal scan coverage since extending the scan coverage beyond 40 mm results in significant cone-beam artifacts. A multiaxial CT acquisition is achieved by combining multiple sequential 3rd generation axial scans or by performing a single axial multisource CT scan w...

A significant special case of the problems which could be solved were those whose constraints were given by semidefinite cones. A Semidefinite Program (SDP) is an optimisation over the intersection of an affine set and cone of positive semidefinite matrices (Alizadeh and Goldfarb, 2001). Cone programming is discussed more in Section 3. Within semidefinite programming there is a smaller set of p...

Circular antenna array has gained immense popularity in the field of communications nowadays. It has proved to be a better alternative over other types of antenna array configuration due to its all-azimuth scan capability, and a beam pattern which can be kept invariant. This paper is basically concerned with the thinning of a large multiple concentric circular ring arrays of uniformly excited i...

We studied spatial summation for S-cone ON and OFF signals as a function of retinal eccentricity in human subjects. S-cone isolation was obtained by the two-colour threshold method of Stiles, modified by adding blue light to the yellow background. Test stimuli were blue light increments or decrements within a circular area of variable size. These were presented for 100 ms at 0 to 20 deg along t...