[PDF] Top 20 Stability in E convex programming

... mathematical programming has many types, one of these types depends on making perturbation to the decision space or to the objective space or to both by a ...called stability in parametric ... See full document

... DC programming of type ...of convex analysis. In this paper, we extend these results to DC programming in topological vector spaces and also derive some new necessary and/or sufficient conditions for ... See full document

... We now present numerical experiments that verify the recovery guarantee for bilinear inversion from phaseless Fourier measurements by program (8). We consider the noiseless case with i.i.d. Gaussian matrices B and C. In ... See full document

... The extensive experimental study in this paper was made possible with help from several researchers. Special thanks to Dr. Seung Jean Kim for helping in replicating their experiments. Dr. Johan L¨ofberg answered many ... See full document

... ABSTRACT The problems of multivariate sampling arising in the areas of stratified random sampling, two stage sampling, double sampling and response errors formulate as multiobjective con[r] ... See full document

... the stability of a convex hull of matrices that will be applied to study the stability of interval dynamical ...from stability theory are repro- duced and ... See full document

... The results also immediately imply impossibility and possibility results for rewritabil- ity: unless the polynomial hierarchy collapses to its first level, it is not possible in the FLP semantics to rewrite a program ... See full document

... algorithm. In [CLS15b], the authors provided theoretical guarantees for a stochastic gradient descent based algorithm (called the WF algorithm). A carefully chosen initialization and concentration inequalities are an ... See full document

... l ≤ Ax ≤ ¯ h divided two part, ¯ l ≤ Ax and Ax ≤ ¯ h, thus dimension of problem increases. First time, Xia et al. studied [22] a neural network for solving (1.1) without dividing ¯ l ≤ Ax ≤ ¯ h into two part. Proposed ... See full document

... The point z 3 is added to the approximation by building the convex hull of the points generated so far and thus updating the approximation and the underlying norm (gauge) simultaneously as shown in Figure (2-d). ... See full document

... The algorithm requires only a membership oracle for S and an approximate evaluation oracle for G( · ) (which returns an approximate function value in the queried point). We show that with high probability our algorithm ... See full document

... that convex hull algorithm using sequential, OpenMP, MPI and Hybrid is tasted for the variant of data set and finally OpenMP gives good result as compared to Sequential ... See full document

... The paper is organized as follows. In Sect. 2, we construct a general fuzzy nonlinear programming problem and formulate its Mangasarian type dual. Further, we prove duality theorems using exponential membership ... See full document

... of stability for limit cycles of PWA ...of stability are larger than the results of ex- isting ...the stability conditions are easier to be satisified, and the parameters of the system could be less ... See full document

... bi-objective programming has been proposed for dealing with decision process involving two decision ...bi-objective programming problem in which both objective functions are definite quadratic is ... See full document

... In the case of fixed-geometry arrays (wherein the antenna layout is a-priori assigned while the elements’ excitations are the only unknowns), the problem has been solved in a globally-optimal fashion in both cases of ... See full document

... an E-convex set and an E-convex function were introduced first by Youness ...of E- convex programming problems were discussed by Youness [], and E-Fritz-John and ... See full document

... Statement: Let A and B be convex subsets of a finite dimensional real Hilbert space. If one of the two conditions is void.A has a non-empty interior and B does not intersect the interior of A hold. Then A and B ... See full document

... the stability set of the first kind for convex multiobjective nonlinear programming (MONLP) problems with fuzzy parameters in the constraints and for convex MONLP problems with fuzzy ... See full document

... where the above inequalities hold because f , g are E-[, ] convex at x ∗ with respect to the same E (see Theorem . in []). Thus, x ∗ is the minimizer of f (x) under the constraint g(x) ≤ , ... See full document