نتایج جستجو برای: multiple sets problems convex minimization problems
تعداد نتایج: 1528786 فیلتر نتایج به سال:
abstract global financial crisis has created too many problems in relations among governments. among these problems, the issue of global monetary management, more than every time in the past four decades, has been moved in the center of international economic attentions. a problem which is specially known with the monetary hostility between united states and public republic of china. where ar...
Many optimization problems arising in various applications require minimization of an objective cost function that is convex but not di erentiable. Such a minimization arises, for example, in model construction, system identi cation, neural networks, pattern classi cation, and various assignment, scheduling, and allocation problems. To solve convex but not di erentiable problems, we have to emp...
A wide range of free boundary problems occurring in engineering and industry can be rewritten as a minimization problem for a strictly convex, piecewise smooth but non{diierentiable energy functional. The fast solution of related discretized problems is a very delicate question, because usual Newton techniques cannot be applied. We propose a new approach based on convex minimization and constra...
A wide range of free boundary problems occurring in engineering and industry can be rewritten as a minimization problem for a strictly convex, piecewise smooth but non–differentiable energy functional. The fast solution of related discretized problems is a very delicate question, because usual Newton techniques cannot be applied. We propose a new approach based on convex minimization and constr...
with the increasing population and the need for more food, as well as with the development of science and technology, human approach to unnatural and often chemical inputs to increase agricultural production has been a great expansion and problems such as increased cancers, chronic diseases has created environmental pollution. implementation of organic organic is a solution to these problems . ...
Convergence Analysis of the Approximate Proximal Splitting Method for Non-Smooth Convex Optimization
Consider a class of convex minimization problems for which the objective function is the sum of a smooth convex function and a non-smooth convex regularity term. This class of problems includes several popular applications such as compressive sensing and sparse group LASSO. In this thesis, we introduce a general class of approximate proximal splitting (APS) methods for solving such minimization...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید