نتایج جستجو برای: interior
تعداد نتایج: 36232 فیلتر نتایج به سال:
One of the fundamental concepts in convex analysis and optimization is the relative interior of a set. This concept is used when the interior of a set is empty due to the incompleteness of its dimension. In this paper, first, we propose a linear programming model to find a relative interior point of a polyhedral set. Then, we discuss the application of this model to geometric programming. Speci...
this study was performed during the abatement of two asbestos-containing materials (acm):baumlite board (cement flat board) and ceiling textile. the concentrations of total dust for personal sampling were 0.28 and 1.70 mg/m3 during baumlite board and ceiling textile abatements, respectively, when calculated with 8-hr time-weighted average (twa). the geometric mean (gm) asbestos concentrations w...
this study was performed during the abatement of two asbestos-containing materials (acm):baumlite board (cement flat board) and ceiling textile. the concentrations of total dust for personal sampling were 0.28 and 1.70 mg/m3 during baumlite board and ceiling textile abatements, respectively, when calculated with 8-hr time-weighted average (twa). the geometric mean (gm) asbestos concentrations w...
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
in this paper, we deal to obtain some new complexity results for solving semidefinite optimization (sdo) problem by interior-point methods (ipms). we define a new proximity function for the sdo by a new kernel function. furthermore we formulate an algorithm for a primal dual interior-point method (ipm) for the sdo by using the proximity function and give its complexity analysis, and then we sho...
Notation: In the sequel K is a field and Σn is the group of permutation over n elements. If A is an operad, then the K-vector space of n-ary operations is denoted as usual by A(n). Recall that if A is regular, then A(n) := An⊗KΣn, where An is the K-vector space of n-ary operations without permutations of the entries. We adopt Sweedler notation for binary cooperation ∆ on a K-vector space V and ...
For each 1 < s < ∞, a Popa algebra As is constructed that embeds as a weakly dense C∗–subalgebra of the interpolated free group factor L(Fs). Certain approximation properties for As are shown. It follows that L(Fs) has the weak expectation property of Lance with respect to As. In the course of the demonstration, it is proved that under certain conditions, full amalgamated free products of matri...
It has been studied that, the fine-irresolute mapping introduced in [13] includes all mappings defined by Császár (cf. [5]) in a fine space which is a special case of generalized topological space. It has been also noted that g-α-irresolute function defined by Bai et al [1] is also included in the same fine-irresolute mapping.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید