List of articles (by subject) Non linear Programming
-
Open Access Article
1 - A numerical approach for optimal control model of the convex semi-infinite programming
حمید روح پرورIn this paper, convex semi-infinite programmingis converted to an optimal control model of neural networks and the optimal control model issolved by iterative dynamicprogramming method. In final, numerical examples are provided forillustration of the purposed method.In this paper, convex semi-infinite programmingis converted to an optimal control model of neural networks and the optimal control model issolved by iterative dynamicprogramming method. In final, numerical examples are provided forillustration of the purposed method. Manuscript profile -
Open Access Article
2 - A New Approach for Solving Interval Quadratic Programming Problem
نعمت اله تقی نژاد فاطمه تالشیان مهدی شهینیThis paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is e MoreThis paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) problems. Afterwards these classical problems are solved using the SQP algorithm and the numerical results are presented. Manuscript profile -
Open Access Article
3 - Comparative Study of Particle Swarm Optimization and Genetic Algorithm Applied for Noisy Non-Linear Optimization Problems
Hossein Towsyfyan امین کلاه دوز Hazem Esmaeel Shahed MohammadiOptimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Partic MoreOptimization of noisy non-linear problems plays a key role in engineering and design problems. These optimization problems can't be solved effectively by using conventional optimization methods. However, metaheuristic algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) seem very efficient to approach in these problems and became very popular. The efficiency of these methods against many new metaheuristic optimization algorithms has been proved in previous works, however a robust comparison between GA and PSO to solve noisy nonlinear problems has not been reported yet. Therefore, in this paper GA and PSO are adapted to find optimal solutions of some noisy mathematical models. Based on the obtained results, GA shows a promising potential in terms of number of iteration to converge and solutions found so far for either for optimization of low or elevated levels of noise. Manuscript profile -
Open Access Article
4 - Optimization of solution stiff differential equations using MHAM and RSK methods
شادان صدیق بهزادیIn this paper, a nonlinear stiff differential equation is solved by using the Rosenbrock iterative method, modified homotpy analysis method and power series method. The approximate solution of this equation is calculated in the form of series which its components are co MoreIn this paper, a nonlinear stiff differential equation is solved by using the Rosenbrock iterative method, modified homotpy analysis method and power series method. The approximate solution of this equation is calculated in the form of series which its components are computed by applying a recursive relations. Some numerical examples are studied to demonstrate the accuracy of the presented methods. Manuscript profile -
Open Access Article
5 - A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
معصومه عباسیIn this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This pa MoreIn this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the new DAEs methods. Numerical results show the efficiency of the proposed model. Manuscript profile -
Open Access Article
6 - Solution of optimal control problems using shifted chebyshev polynomial
هاجر علیمرادThis paper suggests a new and efficient method for solving linear quadratic optimal control problems. A shifted chebyshev matrix approach is implemented for solving this problem. In this method, the problem of optimal control changes into a problem of non-linear program MoreThis paper suggests a new and efficient method for solving linear quadratic optimal control problems. A shifted chebyshev matrix approach is implemented for solving this problem. In this method, the problem of optimal control changes into a problem of non-linear programming which can be solved easily. The corresponding nonlinear programming problem will be solved using Matlab software to find the unknown coefficients which are related to the approximate solution. Numerical examples are also given in order to compare this new method with another one. Manuscript profile -
Open Access Article
7 - On the Picard-Mann approach for hybridizing the double direction method for solving a system of nonlinear equations.
Abubakar Halilu Aliyu kiri Mohammed WaziriIn this article, the improvement of the numerical performance of the iterative scheme presented by Halilu and Waziri in [5] is considered. This is made possible by hybridizing it with Picard-Mann hybrid iterative process. In addition, the step length is calculated using MoreIn this article, the improvement of the numerical performance of the iterative scheme presented by Halilu and Waziri in [5] is considered. This is made possible by hybridizing it with Picard-Mann hybrid iterative process. In addition, the step length is calculated using the inexact line search technique. Under the preliminary conditions, the proposed method's global convergence is established. The numerical experiment shown in this paper depicts the efficiency of the proposed method, which improved the results than the double direction method [5], existing in the literature. Manuscript profile