Assessing parameters in autoregressive (AR) models is a fundamental aspect of time-series analysis and is widely used in fields such as finance, climate science, and engineering. Ordinary least squares and maximum likelihood estimation are commonly used for this purpose, but their performance can be affected when the estimation process is subject to complex constraints. In this study, two nonlinear programming techniques—the Gradient Projection (GP) method and Convex Quadratic Programming (CQP) based on the complementary pivot algorithm—were examined for estimating the parameters of an AR(2) model. The two nonlinear methods were compared with traditional estimation techniques using the Mean Squared Error (MSE) as the primary criterion. The findings indicated that both nonlinear methods achieved lower MSE values than the conventional methods. The GP method gave the smallest MSE (25.8959), while CQP produced a value very similar to this (25.8960), showing that both achieved comparable estimation accuracy while meeting the stationary constraints of the AR(2) model. The GP method also required fewer computational resources and converged quickly, whereas the CQP approach converged to the global optimum under the assumed convexity conditions. In general, the results show the promise of nonlinear programming for achieving accurate and computationally efficient parameter estimation in AR(2) models and offer a foundation for applying optimization-based estimation to higher-order autoregressive models.
Statisticians often use regression models like parametric, nonparametric, and semi-parametric models to represent economic and social phenomena. These models explain the relationships between different variables in these phenomena. One of the parametric model techniques is conic projection regression. It helps to find the most important slopes for multidimensional data using prior information about the regression's parameters to estimate the most efficient estimator. R algorithms, written in the R language, simplify this complex method. These algorithms are based on quadratic programming, which makes the estimations more accurate.
This study offers a new Mixed Meta Heuristics algorithm (HGSABAT) for estimating the parameter values of each of the six categories of Non-Linear regression models examined (Misrald, Meyer4, Meyer7, Militky4, Militky2, and MGH09) by combining the Gravitational Search Algorithm and Bat Algorithm. Some models have different numbers of parameters. For example, the Misrald and Militky2 models of the Non-Linear Regression model have two parameters (Bl, B2). In contrast, the MGH09 and Militky4 models have four parameters (MGHl, MGH2, MGH3, and MGH4), in which location as the Meyer4 and Meyer7 models have three attributes (Meyerl, MGH2, and MGH3). To examine the effectiveness of the suggested Hybrid Meta Heuristics algorithm (HGSABAT), a simulatio
... Show Moreان الغرض من هذا البحث هو المزج بين القيود الضبابية والاحتمالية. كما يهدف الى مناقشة اكثر حالات مشكلات البرمجة الضبابية شيوعا وهي عندما تكون المشكلة الضبابية تتبع دالة الانتماء مرة دالة الاتنماء المثلثية مرة اخرى، من خلال التطبيق العملي والتجريبي. فضلا عن توظيف البرمجة الخطية الضبابية في معالجة مشكلات تخطيط وجدولة الإنتاج لشركة العراق لصناعة الأثاث، وكذلك تم استخدام الطرائق الكمية للتنبؤ بالطلب واعتماده
... Show MoreIn this paper, point estimation for parameter ? of Maxwell-Boltzmann distribution has been investigated by using simulation technique, to estimate the parameter by two sections methods; the first section includes Non-Bayesian estimation methods, such as (Maximum Likelihood estimator method, and Moment estimator method), while the second section includes standard Bayesian estimation method, using two different priors (Inverse Chi-Square and Jeffrey) such as (standard Bayes estimator, and Bayes estimator based on Jeffrey's prior). Comparisons among these methods were made by employing mean square error measure. Simulation technique for different sample sizes has been used to compare between these methods.
The theory of probabilistic programming may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, production and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient bi is random variable
... Show MoreThe problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
This paper deals with constructing a model of fuzzy linear programming with application on fuels product of Dura- refinery , which consist of seven products that have direct effect ondaily consumption . After Building the model which consist of objective function represents the selling prices ofthe products and fuzzy productions constraints and fuzzy demand constraints addition to production requirements constraints , we used program of ( WIN QSB ) to find the optimal solution
Linear programming currently occupies a prominent position in various fields and has wide applications, as its importance lies in being a means of studying the behavior of a large number of systems as well. It is also the simplest and easiest type of models that can be created to address industrial, commercial, military and other dilemmas. Through which to obtain the optimal quantitative value. In this research, we dealt with the post optimality solution, or what is known as sensitivity analysis, using the principle of shadow prices. The scientific solution to any problem is not a complete solution once the optimal solution is reached. Any change in the values of the model constants or what is known as the inputs of the model that will chan
... Show MoreIn many applications such as production, planning, the decision maker is important in optimizing an objective function that has fuzzy ratio two functions which can be handed using fuzzy fractional programming problem technique. A special class of optimization technique named fuzzy fractional programming problem is considered in this work when the coefficients of objective function are fuzzy. New ranking function is proposed and used to convert the data of the fuzzy fractional programming problem from fuzzy number to crisp number so that the shortcoming when treating the original fuzzy problem can be avoided. Here a novel ranking function approach of ordinary fuzzy numbers is adopted for ranking of triangular fuzzy numbers with simpler an
... Show More