![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Mahmoud El-Alem
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Khalid Abdulaziz Alnowibet
, Ahmad M. Alshamrani
, Adel Fahad Alrasheedi
, Salem Mahdi
, Mahmoud El-Alem
, Abdallah Aboutahoun, Ali Wagdy Mohamed
:
Efficient Modified Meta-Heuristic Technique for Unconstrained Optimization Problems. Axioms 11(9): 483 (2022) - 2021
- [j11]Mahmoud El-Alem
, Abdallah Aboutahoun, Salem Mahdi
:
Hybrid gradient simulated annealing algorithm for finding the global optimal of a nonlinear unconstrained optimization problem. Soft Comput. 25(3): 2325-2350 (2021)
2010 – 2019
- 2019
- [j10]Alyaa Abdelhalim, Kazuhide Nakata, Mahmoud El-Alem
, Amr B. Eltawil:
A hybrid evolutionary-simplex search method to solve nonlinear constrained optimization problems. Soft Comput. 23(22): 12001-12015 (2019)
2000 – 2009
- 2009
- [j9]Mohammedi R. Abdel-Aziz, Mahmoud El-Alem:
Newton-Krylov Type Algorithm for Solving Nonlinear Least Squares Problems. Int. J. Math. Math. Sci. 2009: 435851:1-435851:17 (2009) - 2005
- [j8]E. Ahmed, Mahmoud El-Alem:
On multiobjective optimization in portfolio management. Appl. Math. Comput. 167(1): 616-621 (2005) - 2003
- [j7]Mohammedi R. Abdel-Aziz, Mahmoud El-Alem:
Solving large-scale constrained least-squares problems. Appl. Math. Comput. 137(2-3): 571-587 (2003) - 2002
- [j6]Salah M. El-Sayed, Mahmoud El-Alem:
Some properties for the existence of a positive definite solution of matrix equation X+A★X-2mA=I. Appl. Math. Comput. 128(1): 99-108 (2002)
1990 – 1999
- 1999
- [j5]John E. Dennis Jr., Mahmoud El-Alem
, Karen Williamson:
A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities. SIAM J. Optim. 9(2): 291-315 (1999) - [j4]Mahmoud El-Alem
:
A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity. SIAM J. Optim. 9(4): 965-990 (1999) - 1997
- [j3]John E. Dennis Jr., Mahmoud El-Alem
, María Cristina Maciel:
A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization. SIAM J. Optim. 7(1): 177-207 (1997) - 1995
- [j2]Mahmoud El-Alem
:
A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization. SIAM J. Optim. 5(2): 348-378 (1995) - 1994
- [j1]Brett M. Averick, Christian H. Bischof, Robert E. Bixby, Alan Carle, John E. Dennis Jr., Mahmoud El-Alem, Amr El-Bakry, Andreas Griewank
, G. Johnson, Robert M. Lewis, Jorge J. Moré, Richard A. Tapia, Virginia Torczon, Karen Williamson:
Numerical Optimization At the Center for Research On Parallel Computation. Int. J. High Perform. Comput. Appl. 8(2): 143-153 (1994)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint