default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Reza Peyghami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j27]Masoud Ataei
, Shengyuan Chen, Zijiang Yang, M. Reza Peyghami:
Time-homogeneous top-K ranking using tensor decompositions. Optim. Methods Softw. 35(6): 1119-1143 (2020)
2010 – 2019
- 2019
- [j26]M. Momeni, M. Reza Peyghami:
A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization. Optim. Methods Softw. 34(3): 650-664 (2019) - 2018
- [j25]Raheleh Khanduzi, M. Reza Peyghami, Arun Kumar Sangaiah:
Data envelopment analysis and interdiction median problem with fortification for enabling IoT technologies to relieve potential attacks. Future Gener. Comput. Syst. 79: 928-940 (2018) - [j24]Sajad Fathi Hafshejani, Alireza Fakharzadeh Jahromi, Mohammad Reza Peyghami, Shengyuan Chen:
Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term. J. Optim. Theory Appl. 178(3): 935-949 (2018) - [j23]Raheleh Khanduzi, Asyieh Ebrahimzadeh, M. Reza Peyghami:
A modified teaching-learning-based optimization for optimal control of Volterra integral systems. Soft Comput. 22(17): 5889-5899 (2018) - [c5]M. Reza Peyghami, Kevin Yang, Shengyuan Chen, Zijiang Yang, Masoud Ataei:
Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization. Canadian AI 2018: 231-238 - 2017
- [j22]D. Ataee Tarzanagh, Parvin Nazari, M. Reza Peyghami:
A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations. Comput. Math. Appl. 73(2): 339-354 (2017) - 2016
- [j21]F. Arzani, M. Reza Peyghami:
A new nonmonotone filter Barzilai-Borwein method for solving unconstrained optimization problems. Int. J. Comput. Math. 93(3): 596-608 (2016) - [j20]M. Reza Peyghami, Sajad Fathi Hafshejani, S. Chen:
A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions. Oper. Res. Lett. 44(3): 319-323 (2016) - 2015
- [j19]M. Reza Peyghami, D. Ataee Tarzanagh:
A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems. Comput. Optim. Appl. 61(2): 321-341 (2015) - [j18]D. Ataee Tarzanagh, M. Reza Peyghami:
A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems. J. Glob. Optim. 63(4): 709-728 (2015) - [j17]Z. Akbari, Rohollah Yousefpour, M. Reza Peyghami:
A New Nonsmooth Trust Region Algorithm for Locally Lipschitz Unconstrained Optimization Problems. J. Optim. Theory Appl. 164(3): 733-754 (2015) - [j16]D. Ataee Tarzanagh, M. Reza Peyghami, Fabian Bastin:
A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems. J. Optim. Theory Appl. 167(2): 676-692 (2015) - [j15]D. Ataee Tarzanagh, Z. Saeidian, M. Reza Peyghami, Hamid Mesgrani:
A new trust region method for solving least-square transformation of system of equalities and inequalities. Optim. Lett. 9(2): 283-310 (2015) - [j14]M. Reza Peyghami, H. Ahmadzadeh, A. Fazli:
A new class of efficient and globally convergent conjugate gradient methods in the Dai-Liao family. Optim. Methods Softw. 30(4): 843-863 (2015) - 2014
- [j13]M. Reza Peyghami, Sajad Fathi Hafshejani, L. Shirvani:
Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 255: 74-85 (2014) - [j12]M. Reza Peyghami, Sajad Fathi Hafshejani:
Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function. Numer. Algorithms 67(1): 33-48 (2014) - [j11]D. Ataee Tarzanagh, M. Reza Peyghami, Hamid Mesgrani:
A new nonmonotone trust region method for unconstrained optimization equipped by an efficient adaptive radius. Optim. Methods Softw. 29(4): 819-836 (2014) - 2013
- [j10]N. Motamedi, M. Reza Peyghami, M. Hadizadeh:
A mixed integer nonlinear programming model for the optimal repair-replacement in the firm. Math. Soc. Sci. 66(3): 366-371 (2013) - 2012
- [j9]Hassan Tavakoli, Mahmoud Ahmadian, M. Reza Peyghami:
Optimal rate irregular low-density parity-check codes in binary erasure channel. IET Commun. 6(13): 2000-2006 (2012) - [j8]M. Reza Peyghami, Raheleh Khanduzi:
Predictability and forecasting automotive price based on a hybrid train algorithm of MLP neural network. Neural Comput. Appl. 21(1): 125-132 (2012) - [j7]M. S. Beyranvand, M. Reza Peyghami, Mehdi Ghatee:
On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date. Optim. Lett. 6(8): 1897-1911 (2012) - [i3]Hassan Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami:
Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel. CoRR abs/1203.4385 (2012) - [i2]Hassan Tavakoli, Mahmoud Ahmadian, M. Reza Peyghami:
Optimal Rate Irregular LDPC Codes in Binary Erasure Channel. CoRR abs/1211.6279 (2012) - 2011
- [c4]Amir Piltan, Soheil Salari, Davood Mirzahosseini, Mohammad Reza Peyghami:
Filter-and-forward relay beamforming in cognitive two-way relay networks. IEEE ANTS 2011: 1-5 - [c3]Hassan Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami:
Optimal rate and maximum erasure probability LDPC codes in binary erasure channel. Allerton 2011 - [c2]Hassan Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami:
Optimal rate for irregular LDPC codes in binary erasure channel. ITW 2011: 125-129 - [c1]B. Zahedi, Mahmoud Ahmadian, Kamal Mohamed-Pour, M. Reza Peyghami, M. Norouzi, Soheil Salari:
Pilot-based individual forward and backward channel estimation in Amplify-and-Forward OFDM relay networks. Wireless Days 2011: 1-5 - [i1]Hassan Tavakoli, Mahmoud Ahmadian-Attari, M. Reza Peyghami:
Optimal Rate for Irregular LDPC Codes in Binary Erasure Channel. CoRR abs/1108.1572 (2011)
2000 – 2009
- 2009
- [j6]Keyvan Amini, M. Reza Peyghami:
Exploring complexity of large update interior-point methods for P*(kappa) linear complementarity problem based on Kernel function. Appl. Math. Comput. 207(2): 501-513 (2009) - [j5]M. Reza Peyghami:
An interior Point Approach for Semidefinite Optimization Using New Proximity Functions. Asia Pac. J. Oper. Res. 26(3): 365-382 (2009) - 2008
- [j4]Maziar Salahi, M. Reza Peyghami, Tamás Terlaky:
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. Eur. J. Oper. Res. 186(2): 466-485 (2008) - 2007
- [j3]Keyvan Amini, Nezam Mahdavi-Amiri, M. Reza Peyghami:
Extended reduced rank two Abaffian update schemes in the ABS-type methods. Appl. Math. Comput. 185(1): 255-265 (2007) - 2006
- [j2]Keyvan Amini, M. Reza Peyghami:
Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function. Appl. Math. Comput. 176(1): 194-207 (2006) - [j1]Antoine Deza, Eissa Nematollahi, M. Reza Peyghami, Tamás Terlaky:
The central path visits all the vertices of the Klee-Minty cube. Optim. Methods Softw. 21(5): 851-865 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
