التحدب الإحداثي واجتماع أربع مجموعات نجمية في by عدنان ظريف, سهيل محفوض, براءة عفيصة

“…A is called a coordinate convex set ,if and only if ,any parallel line to any coordinate axes oX ,oY ,oZ was intersected with A is convex set . …”
Get full text

التحدب الإحداثي واجتماع مجموعة نجمية في by عدنان ظريف, سهيل محفوض, براءة عفيصة

“…A is called a coordinate convex set if, and only if, any parallel line to any coordinate axes oX ,oY ,oZ was intersected with A is a convex set . …”
Get full text

التحدب الإحداثي واجتماع مجموعة نجمية في by عدنان ظريف, سهيل محفوض, براءة عفيصة

“…A is called a coordinate convex set if, and only if, any parallel line to any coordinate axes oX ,oY ,oZ was intersected with A is a convex set . …”
Get full text

Finite choice, convex choice and finding roots by Stéphane Le Roux, Arno Pauly

“…Precisely, choice from an n+1 point set is reducible to choice from a convex set of dimension n, but not reducible to choice from a convex set of dimension n-1. …”
Get full text

The Security Assignment Problem and Its Solution by Paul Ryan A. Longhas, Alsafat M. Abdul, Edcon B. Baccay

“…In this paper we derived a new method for finding the optimal solution to security assignment problems using projection onto a convex set. This study will help communities find the optimal number of assigned and reserved personnels in designating security officers to an area. …”
Get full text

Relative Isoperimetric Inequality for Minimal Submanifolds in a Riemannian Manifold by Juncheol Pyo

“…Let Σ be a domain on an m-dimensional minimal submanifold in the outside of a convex set C in 𝕊n or ℍn. The modified volume M(Σ) is introduced by Choe and Gulliver (1992) and we prove a sharp modified relative isoperimetric inequality for the domain Σ, (1/2)mmωmM(Σ)m-1≤Volume(∂Σ-∂C)m, where ωm is the volume of the unit ball of ℝm. …”
Get full text

Convex optimization using quantum oracles by Joran van Apeldoorn, András Gilyén, Sander Gribling, Ronald de Wolf

“…Following the classical literature we assume access to a convex set via various oracles, and we examine the efficiency of reductions between the different oracles. …”
Get full text

Construction of radially bounded antiproximinal sets in $L_1$ by Balan V.A.

“…It is shown that in $L_1$ space the polar of the weakly$^*$ convergent sequence contains radially bounded completely convex set.…”
Get full text

An Edge-Directed Diffusion Equation-Based Image Restoration Approach for Font Generation by Mengnan Ding

“…To deal with this issue, this paper combines sparse representation and convex set projection restoration algorithm, and proposes a font generation image restoration method based on edge Diffusion equation. …”
Get full text

التحدب الإحداثي واجتماع أربع مجموعات نجمية في R2 by عدنان ظريف, أحمد الوسوف, براءة عفيصة

“…وفي هذا البحث سوف نبرهن النظرية التالية : "إذا كانت  مجموعة محدبة إحداثياً و متراصة في المستوي الإقليدي عندئذ تكون المجموعة  اجتماعاً لأربع مجموعات نجمية فقط إذا وجد في  أربع نقاط مثل  بحيث تكون كل نقطة جبهية لـ  مرئية ضمن  من إحدى النقاط  أو  على الأقل  " In the Euclidean plane, we say that the set is   coordinate convex set, if and only if, any parallel line to any coordinate axes was intersected with   is convex set . …”
Get full text

Convex underestimating relaxation techniques for nonconvex polynomial programming problems: computational overview by Keller André A.

“…An LMI is equivalent to a system of polynomial inequalities. A semialgebraic convex set describes the system. The feasible sets are spectrahedra with curved faces, contrary to the LP case with polyhedra. …”
Get full text

Robust model predictive control by Schaich, R

“…To deal with state- and input dependent constraint sets a framework for a particular class of set-valued maps is utilised, namely parametrically convex set-valued maps. Relevant properties and operations are developed to accommodate parametrically convex set-valued maps in the context of robust model predictive control. …”

Construction of radially bounded antiproximinal sets in $L_1$ by V. A. Balan

“…It is shown that in $L_1$ space the polar of the weakly* convergent sequence contains radially bounded completely convex set.…”
Get full text

Fixed points of condensing multivalued maps in topological vector spaces by In-Sook Kim

“…From this fact we deduce the fixed point property of a closed convex set with respect to pseudocondensing admissible maps.…”
Get full text

Interval Estimation of Value-at-Risk Based on Nonparametric Models by Hussein Khraibani, Bilal Nehme, Olivier Strauss

“…This estimation is based on a coherent extension of the kernel-based estimation of the cumulative distribution function to convex sets of kernel. We thus obtain a convex set of VaR estimates gathering all the conventional estimates based on a kernel belonging to the above considered convex set. …”
Get full text

التحدب الإحداثي واجتماع أربع مجموعات نجمية في R2 by عدنان ظريف, أحمد الوسوف, براءة عفيصة

“…وفي هذا البحث سوف نبرهن النظرية التالية : "إذا كانت  مجموعة محدبة إحداثياً و متراصة في المستوي الإقليدي عندئذ تكون المجموعة  اجتماعاً لأربع مجموعات نجمية فقط إذا وجد في  أربع نقاط مثل  بحيث تكون كل نقطة جبهية لـ  مرئية ضمن  من إحدى النقاط  أو  على الأقل  " In the Euclidean plane, we say that the set is   coordinate convex set, if and only if, any parallel line to any coordinate axes was intersected with   is convex set . …”
Get full text

Existence and comparison results for variational-hemivariational inequalities by Carl S

“…<p/> <p>We consider a prototype of quasilinear elliptic variational-hemivariational inequalities involving the indicator function of some closed convex set and a locally Lipschitz functional. We provide a generalization of the fundamental notion of sub- and supersolutions on the basis of which we then develop the sub-supersolution method for variational-hemivariational inequalities. …”
Get full text

The Complexity of Continuous Optimization by Rogaway, Phillip

“…Given a polynomial objective function f(x1,…,xn), we consider the problem of finding the maximum of this polynomial inside some convex set D = {x : Ax <= B}. We show that, under a complexity assumption, this extremum cannot be approximated by any polynomial-time algorithm, even exceedingly poorly. …”
Get full text

Invariant Set-Based Analysis of Minimal Detectable Fault for Discrete-Time LPV Systems With Bounded Uncertainties by Junbo Tan, Sorin Olaru, Monica Roman, Feng Xu, Bin Liang

“…Since the proposed MDF computation method is robust regardless of the value of scheduling variables in a given convex set, fault detection (FD) can be guaranteed whenever the magnitude of fault is larger than that of the MDF. …”
Get full text

BOUNDARY CONTROL OF ROD TEMPERATURE FIELD WITH A SELECTED POINT by K. B. Imanberdiyev, B. E. Kanguzhin, A. M. Serik, B. Uaissov

“…Necessary and sufficient conditions for the minimum of a smooth convex functional on a convex set are established. The difference between the results of this work and the available ones is that in the proposed work, the temperature field is given by the heat conduction equation with a loaded term. …”
Get full text