نتایج جستجو برای: step feasible interior
تعداد نتایج: 381234 فیلتر نتایج به سال:
we study interior operators and interior structures in a fuzzy setting.we investigate systems of “almost open” fuzzy sets and the relationshipsto fuzzy interior operators and fuzzy interior systems.
We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set de ned by equality and inequality constraints. The algorithm generates feasible iterates and consists in computing approximate solutions of the optimality conditions perturbed by a sequence of positive parameters converging to zero. We prove that it converges qsuperlinearly for each xed . We als...
This paper deals with a semidefinite program (SDP) having free variables, which often appears in practice. To apply the primal-dual interior-point method, we usually need to convert our SDP into the standard form having no free variables. One simple way of conversion is to represent each free variable as a difference of two nonnegative variables. But this conversion not only expands the size of...
In this paper we present a new iteration-complexity bound for the Mizuno-Todd-Ye predictorcorrector (MTY P-C) primal-dual interior-point algorithm for linear programming. The analysis of the paper is based on the important notion of crossover events introduced by Vavasis and Ye. For a standard form linear program min{cTx : Ax = b, x ≥ 0} with decision variable x ∈ , we show that the MTY P-C alg...
We generalize primal-dual interior-point methods for linear programming problems to the convex optimization problems in conic form. Previously, the most comprehensive theory of symmetric primal-dual interior-point algorithms was given by Nesterov and Todd 8, 9] for the feasible regions expressed as the intersection of a symmetric cone with an aane subspace. In our setting, we allow an arbitrary...
multi-objective optimization with preemptive priority subject to fuzzy relation equation constraints
this paper studies a new multi-objective fuzzy optimization prob- lem. the objective function of this study has dierent levels. therefore, a suitable optimized solution for this problem would be an optimized solution with preemptive priority. since, the feasible domain is non-convex; the tra- ditional methods cannot be applied. we study this problem and determine some special structures related...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید