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

This paper extends the regularized smoothing Newton method in vector optimization to symmetric cone optimization, which provide a unified framework for dealing with the nonlinear complementarity problem, the second-order cone complementarity problem, and the semidefinite complementarity problem (SCCP). In particular, we study strong semismoothness and Jacobian nonsingularity of the total natura...

The paper is devoted to the study of general nonsmooth problems of cone-constrained optimization (or conic programming) important for various aspects of optimization theory and applications. Based on advanced constructions and techniques of variational analysis and generalized differentiation, we derive new necessary optimality conditions (in both " exact " and " fuzzy " forms) for nonsmooth co...

This paper aims to discuss the requirements of safe and smooth trajectory planning of transporter mobile robots to perform non-prehensile object manipulation task. In non-prehensile approach, the robot and the object must keep their grasp-less contact during manipulation task. To this end, dynamic grasp concept is employed for a box manipulation task and corresponding conditions are obtained an...

We are given a finite set of m points (guards) G in the plane R 2 and an angle 0 ≤ Θ ≤ 2π. A Θ-cone is a cone with apex angle Θ. We call a Θ-cone empty (with respect to G) if it does not contain any point of G. A point p ∈ R is called Θ-guarded if every Θ-cone with apex located at p is non-empty. Moreover, the set of all Θ-guarded points is called Θ-region. We first show how to construct a data...

We present a new constraint qualification which guarantees strong duality between a cone-constrained convex optimization problem and its Fenchel-Lagrange dual. This result is applied to a convex optimization problem having, for a given nonempty convex cone K , as objective function a K-convex function postcomposed with a K-increasing convex function. For this so-called composed convex optimizat...

We propose and analyse primal-dual interior-point algorithms for convex optimization problems in conic form. The families of algorithms whose iteration complexity we analyse are so-called short-step algorithms. Our iteration complexity bounds match the current best iteration complexity bounds for primal-dual symmetric interior-point algorithm of Nesterov and Todd, for symmetric cone programming...

Image reconstruction from cone-beam projections collected along a single circular source trajectory is commonly done using the Feldkamp algorithm, which performs well only with a small cone angle. In this report, we propose an error-reduction-based algorithm to increase the cone angle by several folds to achieve satisfactory image quality at the same radiation dose. In our scheme, we first reco...

Positive real cones in the space H∞ appear naturally in many optimization problems of control theory and signal processing. Although such problems can be solved by finite-dimensional approximations (e.g. Ritz projection), all such approximations are conservative, providing one-sided bounds for the optimal value. In order to obtain both upper and lower bounds of the optimal value, a dual problem...

We studied the spatial arrangement of L- and M-cone driven electroretinograms (ERGs) reflecting the activity of magno- and parvocellular pathways. L- and M-cone isolating sine wave stimuli were created with a four primary LED stimulator using triple silent substitution paradigms. Temporal frequencies were 8 and 12 Hz, to reflect cone opponent activity, and 30, 36 and 48 Hz to reflect luminance ...