Mohammad Reza Peyghami
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mohammad Reza Peyghami has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Sajad Fathi Hafshejani
Department of Math and Computer Science, University of Lethbridge, Lethbridge, AB T1K 3M4, Canada
9 shared publications - Keyvan Amini
Department of Mathematics, Faculty of Science, Razi University, Kermanshah, Iran
7 shared publications - Raheleh Khanduzi
Department of Mathematics and Statistics, Gonbad Kavous University, Gonbad-e Kavus, Iran
5 shared publications - Davoud Ataee Tarzanagh
K.N. Toosi University of Technology
4 shared publications F. Arzani
K.N. Toosi University of Technology
3 shared publicationsH. Tavakoli
Electrical Engineering Department, K.N. Toosi University of Technology, Tehran, Iran
3 shared publications
Latest Publications
- Open Access
- 1 October 2021
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 580, 126160
Theory and applications of financial chaos index
- 1 October 2021
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 580, 126160
Open AccessTheory and applications of financial chaos index
- Open Access
Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel
In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster, accurate and practical than other methods. Our method does not use any relaxation or any approximate solution like previous works. Our method works and finds optimal answer for any given check node degree distribution. The proposed method was implemented and it works well in practice with polynomial time complexity. As a result, we represent some degree distributions that their rates are close to the capacity with maximum erasure probability and maximum code rate.
Open AccessOptimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel
In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster, accurate and practical than other methods. Our method does not use any relaxation or any approximate solution like previous works. Our method works and finds optimal answer for any given check node degree distribution. The proposed method was implemented and it works well in practice with polynomial time complexity. As a result, we represent some degree distributions that their rates are close to the capacity with maximum erasure probability and maximum code rate.
- Open Access
- 1 January 2020
- Published by National Library of Serbia in Filomat
- Vol. 34 (5) , 1471-1486
An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
In this paper, a primal-dual interior point algorithm for solving linear optimization problems based on a new kernel function with a trigonometric barrier term which is not only used for determining the search directions but also for measuring the distance between the given iterate and the μ-center for the algorithm is proposed. Using some simple analysis tools and prove that our algorithm based on the new proposed trigonometric kernel function meets O (√n log n log n/ε) and O (√n log n/ε) as the worst case complexity bounds for large and small-update methods. Finally, some numerical results of performing our algorithm are presented.
- 1 January 2020
- Published by National Library of Serbia in Filomat
- Vol. 34 (5) , 1471-1486
Open AccessAn interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
In this paper, a primal-dual interior point algorithm for solving linear optimization problems based on a new kernel function with a trigonometric barrier term which is not only used for determining the search directions but also for measuring the distance between the given iterate and the μ-center for the algorithm is proposed. Using some simple analysis tools and prove that our algorithm based on the new proposed trigonometric kernel function meets O (√n log n log n/ε) and O (√n log n/ε) as the worst case complexity bounds for large and small-update methods. Finally, some numerical results of performing our algorithm are presented.
- 29 March 2019
- Published by Springer Nature in Optimization and Engineering
- Vol. 21 (1) , 107-129
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- 29 March 2019
- Published by Springer Nature in Optimization and Engineering
- Vol. 21 (1) , 107-129
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- 1 September 2018
- Published by Springer Nature in Soft Computing
- Vol. 22 (17) , 5889-5899
A modified teaching-learning-based optimization for optimal control of Volterra integral systems
- 1 September 2018
- Published by Springer Nature in Soft Computing
- Vol. 22 (17) , 5889-5899
A modified teaching-learning-based optimization for optimal control of Volterra integral systems
- 22 June 2018
- Published by Taylor & Francis in Optimization
- Vol. 67 (10) , 1605-1630
Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
In this paper, we propose a large-update primal–dual interior-point algorithm for linear optimization problems based on a new kernel function with a trigonometric growth term. By simple analysis, we prove that in the large neighbourhood of the central path, the worst case iteration complexity of the new algorithm is bounded above by , which matches the currently best known iteration bound for large-update methods. Moreover, we show that, most of the so far proposed kernel functions can be rewritten as a kernel function with trigonometric growth term. Finally, numerical experiments on some test problems confirm that the new kernel function is well promising in practice in comparison with some existing kernel functions in the literature.
- 22 June 2018
- Published by Taylor & Francis in Optimization
- Vol. 67 (10) , 1605-1630
Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
In this paper, we propose a large-update primal–dual interior-point algorithm for linear optimization problems based on a new kernel function with a trigonometric growth term. By simple analysis, we prove that in the large neighbourhood of the central path, the worst case iteration complexity of the new algorithm is bounded above by , which matches the currently best known iteration bound for large-update methods. Moreover, we show that, most of the so far proposed kernel functions can be rewritten as a kernel function with trigonometric growth term. Finally, numerical experiments on some test problems confirm that the new kernel function is well promising in practice in comparison with some existing kernel functions in the literature.
- 6 April 2018
- Published by Springer Nature
- p. 231-238
Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization
- 6 April 2018
- Published by Springer Nature
- p. 231-238
Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization
- Open Access
- 1 March 2018
- Vol. 8 (1) , 19-40
A new dwindling nonmonotone filter method without gradient information for solving large-scale systems of equations
- 1 March 2018
- Vol. 8 (1) , 19-40
Open AccessA new dwindling nonmonotone filter method without gradient information for solving large-scale systems of equations
- 1 February 2018
- Published by Elsevier in Future Generation Computer Systems
- Vol. 79, 928-940
Data envelopment analysis and interdiction median problem with fortification for enabling IoT technologies to relieve potential attacks
- 1 February 2018
- Published by Elsevier in Future Generation Computer Systems
- Vol. 79, 928-940
Data envelopment analysis and interdiction median problem with fortification for enabling IoT technologies to relieve potential attacks
- 31 January 2018
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 34 (3) , 650-664
A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization
In this paper, a new conjugate gradient (CG) algorithm in Dai–Liao (DL) family is presented for solving unconstrained optimization problems. The proposed algorithm tries to adjust positive values for the so-called DL parameter by using quadratic and/or cubic models of the objective function. More precisely, the cubic regularization model of the objective function is properly employed when the non-positive curvature is detected. Besides, the CG parameter is introduced so that the generated CG directions are descent. Under some standard assumptions, we establish the convergence property of the new proposed algorithm. Numerical results on some test problems are reported. The results show that the new algorithm performs well and is competitive with CG_DESCENT method.
- 31 January 2018
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 34 (3) , 650-664
A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization
In this paper, a new conjugate gradient (CG) algorithm in Dai–Liao (DL) family is presented for solving unconstrained optimization problems. The proposed algorithm tries to adjust positive values for the so-called DL parameter by using quadratic and/or cubic models of the objective function. More precisely, the cubic regularization model of the objective function is properly employed when the non-positive curvature is detected. Besides, the CG parameter is introduced so that the generated CG directions are descent. Under some standard assumptions, we establish the convergence property of the new proposed algorithm. Numerical results on some test problems are reported. The results show that the new algorithm performs well and is competitive with CG_DESCENT method.