We consider the problem of measuring margin robust feasibility solutions to a system nonlinear equations. study special case quadratic equations, which shows up in many practical applications such as power grid and other infrastructure networks. This is generalization quadratically constrained programming (QCQP), NP-Hard general setting. develop approaches based on topological degree theory est...

Abstract. We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is defined by a finite yet large number of convex quadratic inequalities. We extend quadratic cut algorithm of Luo and Sun [3] for solving such problems by placing or translating the quadratic cuts directly through the current approxima...

BACKGROUND Communication is complex in endocrine care, particularly during transition from paediatric to adult services. The aims of this study were to examine the feasibility of interventions to support young people to interact with clinicians. METHODS Development and evaluation of a complex intervention in 2 phases: Pre-intervention observational study; Intervention feasibility study. Purpo...

Abstract In this paper, we consider fractional neutral differential equations with multipoint boundary value conditions involving Hadamard derivatives and integrals. We obtain the existence uniqueness of solution equation by using several fixed point theorems, also Ulam–Hyers stability solution. addition, study inclusion problem prove when multivalued map has convex values. give examples to ill...

Manuscript received ; revised . Copyright (c) 2010 IEEE. Personal use of this material is permitted. However, permission to use this material for any other purposes must be obtained from the IEEE by sending a request to [email protected]. A. Carmi is with the Asher Space Research Institute, Technion – Israel Institute of Technology, Haifa 32000, Israel. P. Gurfil is with the Faculty of ...

In this paper, we study the optimal cooperative beamforming problem in amplify-and-forward (AF) multi-user and multi-relay networks, which face challenges of rapid node number variations per-node power limits. To achieve extra diversity gain, direct-link (source-to-destination) distributed relay-link signals are jointly exploited. The is formulated as maximum relay transmit minimization problem...

Many robust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x, ) 0, ∈ D}. This set typically contains an infinite and uncountable number of inequalities, and it has been proved that the related robust feasibility problem is numerically hard to solve in general. In this pap...