M. Reza Peyghami
According to our database^{1},
M. Reza Peyghami
authored at least 31 papers
between 2006 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2018
A modified teachinglearningbased 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. Optim. Theory Appl., 2018
Data envelopment analysis and interdiction median problem with fortification for enabling IoT technologies to relieve potential attacks.
Future Gener. Comput. Syst., 2018
Proceedings of the Advances in Artificial Intelligence, 2018
2017
A nonmonotone PRP conjugate gradient method for solving square and underdetermined systems of equations.
Comput. Math. Appl., 2017
2016
A primaldual interiorpoint method for semidefinite optimization based on a class of trigonometric barrier functions.
Oper. Res. Lett., 2016
A new nonmonotone filter BarzilaiBorwein method for solving unconstrained optimization problems.
Int. J. Comput. Math., 2016
2015
A new class of efficient and globally convergent conjugate gradient methods in the DaiLiao family.
Optim. Methods Softw., 2015
A new trust region method for solving leastsquare transformation of system of equalities and inequalities.
Optim. Lett., 2015
A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems.
J. Optim. Theory Appl., 2015
A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems.
J. Optim. Theory Appl., 2015
A new regularized limited memory BFGStype method based on modified secant conditions for unconstrained optimization problems.
J. Glob. Optim., 2015
A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems.
Comput. Optim. Appl., 2015
2014
A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius.
Optim. Methods Softw., 2014
Complexity analysis of an interiorpoint algorithm for linear optimization based on a new proximity function.
Numer. Algorithms, 2014
Complexity of interiorpoint methods for linear optimization based on a new trigonometric kernel function.
J. Comput. Appl. Math., 2014
2013
A mixed integer nonlinear programming model for the optimal repairreplacement in the firm.
Math. Soc. Sci., 2013
2012
On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date.
Optim. Lett., 2012
Predictability and forecasting automotive price based on a hybrid train algorithm of MLP neural network.
Neural Comput. Appl., 2012
IET Commun., 2012
CoRR, 2012
2011
Pilotbased individual forward and backward channel estimation in AmplifyandForward OFDM relay networks.
Proceedings of the IFIP Wireless Days Conference 2011, 2011
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
Proceedings of the Fifth IEEE International Conference on Advanced Telecommunication Systems and Networks, 2011
2009
An interior Point Approach for Semidefinite Optimization Using New Proximity Functions.
Asia Pac. J. Oper. Res., 2009
Exploring complexity of large update interiorpoint methods for P<sub>*</sub>(kappa) linear complementarity problem based on Kernel function.
Appl. Math. Comput., 2009
2008
New complexity analysis of IIPMs for linear optimization based on a specific selfregular function.
Eur. J. Oper. Res., 2008
2007
Appl. Math. Comput., 2007
2006
Optim. Methods Softw., 2006
Complexity analysis of interiorpoint methods for linear optimization based on some conditions on kernel function.
Appl. Math. Comput., 2006