We discuss two families of valid inequalities for linear mixed integer programming problems with cone constraints of arbitrary order, which arise in the context of stochastic optimization with downside risk measures. In particular, we extend the results of Atamtürk and Narayanan (Math. Program., 2010, 2011), who developed mixed integer rounding cuts and lifted cuts for mixed integer programming...

In this paper we deal with the semivectorial bilevel problem in the Riemannian setting. The upper level is a scalar optimization problem to be solved by the leader, and the lower level is a multiobjective optimization problem to be solved by several followers acting in a cooperative way inside the greatest coalition and choosing among Pareto solutions with respect to a given ordering cone. For ...

The purpose of this paper is to establish some relationships between proper efficiency of set-valued optimization problems and proper efficiency of vector variational-like inequalities under the assumptions of generalized cone-preinvexity. Our results extend and improve the corresponding results in the literature.

We present a variant of the CONEstrip algorithm for checking whether the origin lies in a finitely generated convex cone that can be open, closed, or neither. This variant is designed to deal efficiently with problems where the rays defining the cone are specified as linear combinations of propositional sentences. The variant differs from the original algorithm in that we apply row generation t...

In this paper, Novikov's inversion formula of the attenuated two-dimensional (2D) Radon transform is applied to the reconstruction of attenuated fan-beam projections acquired with equal detector spacing and of attenuated cone-beam projections acquired with a flat planar detector and circular trajectory. The derivation of the fan-beam algorithm is obtained by transformation from parallel-beam co...

Here we propose a cone-beam composite-circling mode to solve the quasi-short object problem, which is to reconstruct a short portion of a long object from longitudinally truncated cone-beam data involving the short object. In contrast to the saddle curve cone-beam scanning, the proposed scanning mode requires that the X-ray focal spot undergoes a circular motion in a plane facing the short obje...

We describe an affine transformation on the (CIE) color matching functions and map the spectral locus as a circle. We then homogenize the right circular cylinder erected by the circle, with respect to a normalizing plane and develop an analytical equation to the chromaticity cone, for the spectral colors. In the interior of the (CIE) chromaticity diagram, by homogenizing elliptic cylinders with...

Frequency-Invariant (FI) beamformer is a type of beamformer that has flat spatial response over a wide range of frequency. In most of the algorithms presented today, this FI characteristic is true for all angles including both main lobe and side lobe. In this paper, a novel uniform circular broadband beamformer with frequency-invariant characteristic is proposed. It attempts to optimize the FI ...

The cone of Completely Positive (CP) matrices can be used to exactly formulate a variety of NP-Hard optimization problems. A tractable relaxation for CP matrices is provided by the cone of Doubly Nonnegative (DNN) matrices; that is, matrices that are both positive semidefinite and componentwise nonnegative. A natural problem in the optimization setting is then to separate a given DNN but non-CP...