default search action
Abdelouahed Hamdi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Abdelouahed Hamdi
, Tahereh Khodamoradi, Maziar Salahi
A penalty decomposition algorithm for the extended mean-variance-CVaR portfolio optimization problem. Discret. Math. Algorithms Appl. 16(3): 2350021:1-2350021:16 (2024) - [j17]Farshid Mehrdoust
Parameter estimation of uncertain stock model using residual method optimized by genetic algorithm: valuation of vulnerable European and barrier options. Soft Comput. 28(13-14): 7721-7738 (2024) - 2023
- [j16]Farshid Mehrdoust, Idin Noorani
Two-factor Heston model equipped with regime-switching: American option pricing and model calibration by Levenberg-Marquardt optimization algorithm. Math. Comput. Simul. 204: 660-678 (2023) - 2022
- [j15]Temadher Alassiry Al-Maadeed, Saeid Ansary Karbasy, Maziar Salahi
On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints. J. Optim. Theory Appl. 194(1): 246-264 (2022) - 2021
- [j14]Wali Khan Mashwani
Ameliorated Ensemble Strategy-Based Evolutionary Algorithm with Dynamic Resources Allocations. Int. J. Comput. Intell. Syst. 14(1): 412-437 (2021) - [j13]Farshid Mehrdoust, Idin Noorani
Calibration of the double Heston model and an analytical formula in pricing American put option. J. Comput. Appl. Math. 392: 113422 (2021) - [j12]Saeid Ansary Karbasy, Abdelouahed Hamdi
An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints. Optim. Lett. 15(4): 1425-1446 (2021) - [j11]Abdelouahed Hamdi, Akram Taati, Temadher Alassiry Al-Maadeed
Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality. RAIRO Oper. Res. 55(Supplement): S2905-S2922 (2021) - 2020
- [j10]Wali Khan Mashwani, Abdelouahed Hamdi, Muhammad Asif Jan
Large-scale global optimization based on hybrid swarm intelligence algorithm. J. Intell. Fuzzy Syst. 39(1): 1257-1275 (2020) - [j9]Temadher Alassiry Al-Maadeed
The Generalized Trust-Region Sub-Problem with Additional Linear Inequality Constraints - Two Convex Quadratic Relaxations and Strong Duality. Symmetry 12(8): 1369 (2020)
2010 – 2019
- 2019
- [j8]Muhammad Sulaiman
An improved whale optimization algorithm for solving multi-objective design optimization problem of PFHE. J. Intell. Fuzzy Syst. 37(3): 3815-3828 (2019) - 2014
- [j7]Abdelouahed Hamdi
Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm. INFOR Inf. Syst. Oper. Res. 52(3): 147-156 (2014) - 2012
- [j6]Abdelouahed Hamdi
Convergence of a Proximal Point Algorithm for Solving Minimization Problems. J. Appl. Math. 2012: 142862:1-142862:13 (2012)
2000 – 2009
- 2009
- [j5]Muhammad Aslam Noor
On difference of two monotone operators. Optim. Lett. 3(3): 329-335 (2009) - 2006
- [j4]E. M. E. Mostafa, Abdelouahed Hamdi
A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems. Appl. Math. Comput. 174(2): 810-832 (2006) - 2005
- [j3]Abdelouahed Hamdi
Two-level primal-dual proximal decomposition technique to solve large scale optimization problems. Appl. Math. Comput. 160(3): 921-938 (2005) - [j2]Abdelouahed Hamdi
A primal-dual proximal point algorithm for constrained convex programs. Appl. Math. Comput. 162(1): 293-303 (2005) - [j1]Abdelouahed Hamdi
Decomposition for structured convex programs with smooth multiplier methods. Appl. Math. Comput. 169(1): 218-241 (2005)
1990 – 1999
- 1998
- [i2]Abdelouahed Hamdi:
Convergence Results on Proximal Method of Multipliers in Nonconvex Programming. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-26 (1998) - [i1]Abdelouahed Hamdi:
Convergence Results on Proximal Method of Multipliers in Nonconvex Programming. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-32 (1998)
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-10-07 21: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
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: