الغاية من البحث هي دراسة وتحليل بعض الطرائق العشوائيَّة شبه المتدرّجة وإمكانية تطبيقها لإيجاد الحل الأمثل لمسائل أمثليّة تخضع لمؤثّرات عشوائيّة وظروف تتحكّم فيها الصدفة. وقد تم إثبات تقارب بعض هذه الطرق الرياضيّة وفعاليتها من أجل بعض المسائل العشوائيَّة غير المحدّبة وغير الملساء والمزوّدة بدالة هدفية وقيود محدّدة وحيث اتخذ مجمّع الطاقة الشمسية كمثال على ذلك.
The purpose of research is the study and analysis of some of the stochastic semi-gradient methods and their applicability to find the optimal solution for the issues of optimization are subject to the effects Random and conditions are controlled by chance, as we proved the convergence of some of these mathematical methods and their effectiveness for some of the issues of stochastic non-convex and equipped objective function and specific constraints and where taken energy complex solar as an example
References used
MIHALEVECHV.C.GUPALA.M.NORKIN V.I. non convex optimization techniques- m. Science 1997. 280S
YRMOLIEV. U.M. YASTREMCKI. A.E. Methods of stochastic programming problems of Planning reserves- cybernetics ,1999, 320 c
NIKIFOROVV.A. mathematical simple model of solar collector heating buildings- heliotekhnika.1983. №1,pp56-80
KUTLEEVK.K.,SEYITKURBANOV C.SEKAEV V. A. , URYASEVS.P. calculation method of autonomous systems water and electricity to the helio-wind power plants. Ashgabat. NGOs*Sun*Turkmenian Academy of Sciences, 1987 35C
FOUSKAKIS, D. and DRAPER,D. Stochastic Optimization:2002
The purpose of this research is to study and create a mathematical model under the terms of the probability of randomly imposed, specially by building a model of random Complex Solar particular by removing the salinity of the water, and thus to obtai
Conjugate gradient algorithms are important for solving unconstrained optimization
problems, so that we present in this paper conjugate gradient algorithm depending on
improving conjugate coefficient achieving sufficient descent condition and globa
Interior point methods are considered the most powerful tools for solving
linear, quadratic and nonlinear programming. In each iteration of interior
point method (IPM) at least one linear system has to be solved. The main
computational effort of I
This work deals with a new method for solving Integer Linear Programming Problems depending on a previous methods for solving these problems, such that Branch and Bound method and Cutting Planes method where this new method is a combination between t
Defining some of the essential definitions and conceptions.
Stochastic matrix.
Stability.
Approximate stability.
Approximate stability in the quadratic middle.
Formula of a system of unsettled non stationary stochastic
differential equations.