نتایج جستجو برای: non convex
تعداد نتایج: 1360567 فیلتر نتایج به سال:
In this article we survey the existence of best proximity points for a class of non-self mappings which satisfy a particular nonexpansiveness condition. In this way, we improve and extend a main result of Abkar and Gabeleh [A. Abkar, M. Gabeleh, Best proximity points of non-self mappings, Top, 21, (2013), 287-295] which guarantees the existence of best proximity points for nonex...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
nonnegative matrix factorization (nmf) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. methods in alternating least square (als) approach usually used to solve this non-convex minimization problem. at each step of als algorithms two convex least square problems should be solved, which causes high com...
Abstract We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). call this algorithm nested Benders (NC-NBD). NC-NBD is based on solving dynamically improved linear outer approximations of the MINLP, obtained by piecewise relaxations functions. Those MILPs are solved global optimality using an enhancement decomposi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید