profile - Razi University
Faculty Member of Razi University
Razi University
Keyvan Amini
Professor / Science / Mathematics
Current courses
| Course Name | unit | term |
|---|---|---|
| Advance nonlinear Programming | 4 | first semester Academic year 2026-2027 |
Master Theses
-
A finite termination gradient method for two-dimensional quadratic functions
Zahra Aghaei 2026 -
A Modified Adaptive Levenberg-Marquardt Method for Solving a System of Nonlinear Equations
Kambiz Khosravi fard 2025 -
Gradient methods with retards for solving quadratic nonlinear optimization problems
Nadeya Kaleh vandi 2025يك خانواده مهم از اين اصلاحات روش هاي گراديان با تآخيرمي باشد. روش هاي گراديان با تاخير (GMR) يك روش تكراري غير يكنوا است كه براي حل معادلات خزي بزرگ متقارن و همچنين معين مثبت توسعه يافته است. اين روش تعميمي از روش هاي تندترين شيب و برزيليا-بوروين است.در اين پايان نامه همگرايي R-خطي اين روش اثبات مي شود و همچنين برخي از روش هاي گراديان دوري مورد مطالعه قرار مي گيرد.بررسي طول گام يوان و خواص طيفي روش هاي گراديان از ديگراهداف اين پايان نامه مي باشد.
-
Studying some efficient algorithms based on projection algorithms using conjugate gradient directions for solving constrained nonlinear monotone and pseudo-monotone equations
Zahra Kamari 2024 -
A new Barzilai- Borwein gradient method with quadratic termination property
SAHAR MORADI 2023 -
Studying a family of spectral gradient methods for solving unconstrained optimization
Parya Karami 2023Gradient family methods are known as one of the most important methods for solving unconstrained optimization problem. Spectral gradient methods are an extensions of gradient methods which aims to overcome some of the drawbacks of gradient methods and produce some efficient methods. In this thesis, the first goal is to study a new family of spectral gradient methods while this family uses a new stepsize which is determined by a convex combination of the long and short Barzilai–Borwein (BB) stepsizes. It is also shown that each member of this family have some appropriate quasi-Newton properties. In the sequel, the convergence properties of the new algorithm is investigated and it is shown that the new family of methods is R-superlinearly convergent for two-dimensional problems and R-linearly convergent for the any-dimensional cases. In the second part of this thesis, some of cyclic gradient methods have been studied and a new cyclic gradient method and its convergence properties is studied.
-
Introducing some new stepsizes for the gradient methods
Fateme Kazemi 2022 -
Exponential integrator schemes for solving semilinear differential equations
Minoo Ahmadi 2022 -
Some Accelerated Multiple Step_Size Gradient Algorithm to Solve Unconstrained Optimization
Atefeh Rostampour 2022ABSTRACT Two transformations of gradient-descent iterative methods for solving unconstrained optimization are proposed. The first transformation is called modification and it is defined using a small enlargement of the step size in various gradient-descent methods. The second transformation is termed as hybridization and it is defined as a composition of gradient-descent methods with the Picard–Mann hybrid iterative process. As a result, several accelerated gradient-descent methods for solving unconstrained optimization problems are presented, investigated theoretically and numerically compared. The proposed methods are globally convergent for uniformly convex functions satisfying certain condition under the assumption that the step size is determined by the backtracking line search. In addition, the convergence on strictly convex quadratic functions is discussed. Numerical comparisons show better behaviour of the proposed methods with respect to some existing methods in view of the Dolan and Moré’s performance profile with respect to all analysed characteristics: number of iterations, the CPU time, and the number of function evaluations. KEYWORD : Unconstrained Optimization; Gradient-Descent methods; Muiti Step-Size; Convergence; line Search.
-
Barzilai-Borwin Conjugate Gradient Methods for Unconstrained Optimization
Sahar Jalilian 2021 -
Derivative-free three-term projection algorithms for solving nonlinear monotone equations
Farnaz Mohamadsadeghi 2020دستگاه معادلات غيرخطي يكي از مسائل مهم و پركاربرد در رياضيات است. روشهاي متفاوتي براي حل اين مسائل تاكنون ارائه شده است. از ميان روشهاي تكراري براي حل اين مسائل، ميتوان به روش نيوتون، روشهاي شبه نيوتن و نسخههاي تغيير يافته آنها اشاره كرد.يكي از نقاط ضعف مهم اين روشها بخصوص براي مسائل با ابعاد بزرگ، نياز به محاسبه ماتريس ژاكوبي در هر تكرار و حل دستگاه معادلات خطي متناطر است. تلاش براي ارائه روشهاي بدون ژاكوبي براي حل دستگاههاي معادلات غيرخطي در سالهاي اخير همواره مورد توجه محققان بوده است. در حالات خاص كه دستگاه معادلات داراي خواص ويژه ميباشد، الگوريتمهاي بسيار موثري معرفي شدهاند. يكي از اين ردههاي خاص، دستگاه معادلات غيرخطي يكنوا ميباشد كه روشهاي حل متفاوتي براي آن ارائه شده است. يكي از مهمترين رده هاي موجود براي حل اين مسائل، الگوريتمهاي مبتني بر تصوير است كه بواسطه نياز به حافظه كم، در حل دستگاه معادلات غيرخطي مقياس بزرگ يكنوا كاربردهاي زيادي دارند. هدف اين پاياننامه، ارائه دو خانواده جديد از الگوريتمهاي بدون مشتق مبتني بر تصوير است كه از جهاتي شبيه جهات گراديان مزدوج سهجملهاي استفاده مي كنند جاييكه ثابت مي شود جهات تعريف شده در شرايط كاهش كافي صدق مي كنند. نتايج عددي به دست آمده نشان ميدهد كه اين روشها براي حل اين نوع از مسائل موثر و كارا هستند.
-
Diagonal quasi-newton methods
Foroozan Javaheri 2020Diagonal quasi-Newton method
-
Two spectral conjugate gradient method based on quasi-newton equation
Sedighe Esmaeilzadeh 2020Two spectral conjugate gradient methods based on some quasi-newton equation
-
Convergence analysis of modified BFGS algorithms for solving a nonconvex unconstrained optimization
Shadi Eslahi 2019Quasi-newton methods are an important class of iterative methods for solving unconstrained optimization.These methods can be used when the Hessian matrix is difficult or time consuming to eraluate. Insted of using an estimate of the Hessian matrix, these methods buildup an approximate Hessian matrix by using gradient information. This family is one of the popular algorithms and has many advantages, but there are some drawbacks on them. This methods only use the gradient valuse and don't use the function valuse.Also, in most cases, the quasi newton method can't guarantee the positive definite of Hessian matrix.The modified quasi-newton methods suggest some proposals to overcoming this disadvantages.\\\\In this thesis, two new family of modified quasi-newton methods were investigated. firstly, a modified BFGS algorithm with global convergence properties for nonconvex functions were presented. In the second part by modifying the interpolation conditions to approximate the quadratic model of the function, a new modified quasi-newton equation is introduced. Based on this equation, a modified BFGS algorithm is presented.
-
Numerical methods for approximation of the solution of the fractional initial value problems by Legendre fractional functions
Mahdiyeh Moradidoabi 2019 -
Two three-terms conjugate gradient methods based on secant conditions for unconstrained optimization
Nasrin Ghasemi 2019 -
Some secant-based Nesterov methods for unconstrained optimization
Banan Mansuri 2018 -
Some modified Levenberg-Marquardt methods for solving nonlinear equations
Ahmad reza Hejazi yeganeh 2018 -
Some scaled conjugate gradient method with moving asymptotes to solve an unconstrained optimization problem
Gahandar Maftoon 2018روش هاي گراديان مزدوج يك خانواده مهم براي حل مسائل بهينه سازي نامقيد هستند. در اين روش ها به دليل عدم نياز به استفاده از ماتريس هسي يا تقريب آن، استفاده كم از حافظه ماشين و خواص همگرايي موضعي و سراسري مناسب، به روش هايي بسيار مطلوب براي حل مسائل بهينه سازي نامقيد در مقياس بزرگ تبديل شده اند. به دليل اينكه اين الگوريتم ها به طور معمول فقط از اطلاعات مشتق مرتبه اول تابع هدف استفاده مي كنند، بنابران ممكن است همگرايي آنها كند باشد.در اين پايان نامه تركيبي از گراديان مزدوج مقياس يافته و روش مجانب متحرك براي حل مسائل بهينه سازي نامقيد غير خطي در مقياس بزرگ ارائه شده است.در اين روشها جهت كاهشي مورد استفاده در هر تكرار به وسيله حل زير مسايل جداييپذير محدب توليد شده توسط جهاتمجانبي توليد ميگردد. همچنين در اين پايان نامه با استفاده از روشهاي ناحيه اطمينان پارامترهاي مجانبي جديد و مؤثري تعريف ميگردند. بررسي خواص همگرايي و عددي روشها هدف بعدي اين پايان نامه است.
-
Convergence of implicit methods for the numerical solution of RODEs
AZAR MIRZAEI 2018In recent years numerical solution of random ordinary di?erential equations has attracted lots of researchers. Inthisthesisat?rstsomelinearmulti-stepmethodsarederived,andthenundersome assumptions their local error order are established. Then pathwise convergence and B-stabilityofthesemethodsareobtained. Inthefollowing,someimplicitschemesare presented for the pathwise simulation of sti? ordinary di?erential equations, specif- ically an implicit averaged Euler scheme and an implicit averaged midpoint scheme will be considered. Convergence and B-stability proofs of these averaged methods are presented and the numerical schemes are tested for some medical example.
-
Gradian-Like methods for computing the extreme eigenvalue
Saman Ghaderi 2017Egienvalue problem is one of the most problems in applied mathematics. Amongall of egienvalues the smallest and largest egienvalues have some special importance.Researchers proposed, many numercal methods to solve this problem. In this thesisthe problem of the largest egienvalue of a symetric matrix, convert to a unconstrainedoptimization. Now, we can get a new algorithm by appling an efficient algorithmto solve the generated unconstrained problem. In this thesis, using of a BarzilaiBorwein-like method is proposed. The numerical experimets show the new methodis useful and efficient.
-
Design and implementation of fuzzy soft expert system for heart disease diagnosis
ZAINAB SHANTA AYYAL 2017 -
Modified derivative-free algorithms based on modified conjugate gradient methods for solving nonlinear monotone equations.
Parisa Ostovari deh majnooni 2017Nonlinear monotone system of equations is one of the most important problems in applied mathematics where arise in various applications such as subproblems in the generalized proximal algorithms with Bregman distance. There are many various methods to solve this problem, such as Newtons method,quasi-newton method and modified version of them. The important weakness of these methods especially for large scale problems is the need to calculate Jacobian matrix in each iteration and solving the corresponding system of linear equations.projection based algorithms are one of the efficient methods for solving the monotone nonlinear system of equations. In this thesis, Motivated by some conjugate gradient method and the projection technique two new families of projection based methods is provided to solve nonlinear monotone system of equations. The obtained numerical results show that the methods are effective and efficient.
-
Convergance Analysis of Brazila-Borwein methods
Hadise Shirzadi kangarshahi 2017The gradient methods family is an important family of existent method for solving unconstrained optimization problems. The Barzilai-Borwein gradientmethod is one of the most important gradient methods that has low compution and appropriate speed convergence. This method has R-superlinear convergence rate for two-dimensional strictly convex quadratic functions. In this thesis, we present a new convergence analysis for the BB gradient method that indicate this method has R-superlinear convergence rate with rate $\\sqrt{2}$. In the second part of the thesis, by combining the conjugate gradient methods and the BB method an algorithm useing of step size BB is presented that keeps appropriate properties of both methods. the next topic of the thesis analyzes the convergence properties of the above-mentioned method.
-
Existence and multiplicity of nontrivial solutions for kirchhoff-type equations
Sajad Hasanvandi 2016 -
damped quasi -newton methods for unconstrained optimization problem
Elham Haghi 2015 -
The New Levenberg –Marquardt and Trust-region Methods for Solving Nonlinear Equations
Borhan Zarei ghobadi 2015 -
Analysis of Task Based Parallelization of the QZ Algorithm for Computing Eigenvalues
Nima Sahraneshin Samani 2015 -
Analysis,coparison and evaluation of segmentation and classification methods for satelite image
Mohammad Sayiad gelyan 2015 -
primal-dual interior point methods for P*(?)-linear complementarity problems based on a new Kernel function
2014 -
two sufficient descent nonlinear conjugate gradian algorithms with an optimal prpperty
2014 -
ASelf- Scaling Class of Modified Quasi- Newton Methods
Suma Barari 2014 -
Nonmonotone PSB Quasi- Newton Algorithms
Gholam hasan Karami 2013 -
Two techniques for combination of conjugate gradient and trust region methods for solving unconstrained nonlinear optimization
Shabnam Afaridandhe 2013 -
a new three-term conjugate gradient methods for solving unconstrained optimization
REZVAN AFSARI 2013 -
Investigation the family of modified secant methods and related conjugate gradent methods
2013 -
on nonmonotone trust region methodsof conic model for unconstrained optimization
2012 -
A adrivative-free nonmonotone line search and its application to the spectral residual method
Maryam Shirzad 2012 -
A derivative-free nonmonotone line search and its application to the spectral residual method
2012 -
Some new extended conjugate gradiant methods
2011 -
Some new algorithms for solving the trust region subproblem
2010 -
روش هاي BFGSاصلاح شده و بررسي همگرايي آن ها
2010 -
New integer linear programming approaches for course timetabling
SADEGH AMIRI 2010 -
Nonmonotone TrustRegion Method with Adaptive Radius
2009 -
Two new family of conjugate gradient methods
2009 -
A multi-iterate method for solving systems of nonlinear equations and analysiss error
2009 -
An Active set - Trust- Region Algorithm For Box Constrained Optimization
2008 -
New Adaptive Stepsize Selections in Gradient Methods
2008 -
Scheduling the professional soccor With Integer Linear programming
2008
