M. Reza Peyghami
According to our database1, M. Reza Peyghami authored at least 33 papers between 2006 and 2018.
Legend:Book In proceedings Article PhD thesis Other
A modified teaching-learning-based optimization for optimal control of Volterra integral systems.
Soft Comput., 2018
Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term.
J. Optimization Theory and Applications, 2018
Data envelopment analysis and interdiction median problem with fortification for enabling IoT technologies to relieve potential attacks.
Future Generation Comp. Syst., 2018
Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization.
Proceedings of the Advances in Artificial Intelligence, 2018
A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations.
Computers & Mathematics with Applications, 2017
A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions.
Oper. Res. Lett., 2016
A new nonmonotone filter Barzilai-Borwein method for solving unconstrained optimization problems.
Int. J. Comput. Math., 2016
A new class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family.
Optimization Methods and Software, 2015
A new trust region method for solving least-square transformation of system of equalities and inequalities.
Optimization Letters, 2015
A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems.
J. Optimization Theory and Applications, 2015
A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems.
J. Optimization Theory and Applications, 2015
A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems.
J. Global Optimization, 2015
A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems.
Comp. Opt. and Appl., 2015
A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius.
Optimization Methods and Software, 2014
Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function.
Numerical Algorithms, 2014
Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function.
J. Computational Applied Mathematics, 2014
A mixed integer nonlinear programming model for the optimal repair-replacement in the firm.
Mathematical Social Sciences, 2013
On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date.
Optimization Letters, 2012
Predictability and forecasting automotive price based on a hybrid train algorithm of MLP neural network.
Neural Computing and Applications, 2012
Optimal rate irregular low-density parity-check codes in binary erasure channel.
IET Communications, 2012
Optimal Rate Irregular LDPC Codes in Binary Erasure Channel
Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel
Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel
Pilot-based individual forward and backward channel estimation in Amplify-and-Forward OFDM relay networks.
Proceedings of the IFIP Wireless Days Conference 2011, 2011
Optimal rate for irregular LDPC codes in binary erasure channel.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011
Optimal rate and maximum erasure probability LDPC codes in binary erasure channel.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011
Filter-and-forward relay beamforming in cognitive two-way relay networks.
Proceedings of the Fifth IEEE International Conference on Advanced Telecommunication Systems and Networks, 2011
An interior Point Approach for Semidefinite Optimization Using New Proximity Functions.
Exploring complexity of large update interior-point methods for P*(kappa) linear complementarity problem based on Kernel function.
Applied Mathematics and Computation, 2009
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function.
European Journal of Operational Research, 2008
Extended reduced rank two Abaffian update schemes in the ABS-type methods.
Applied Mathematics and Computation, 2007
The central path visits all the vertices of the Klee-Minty cube.
Optimization Methods and Software, 2006
Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function.
Applied Mathematics and Computation, 2006