default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaziar Salahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j54]Rita Shakouri
, Maziar Salahi:
Malmquist-Luenberger Productivity Index for a Two-Stage Structure in the Presence of Undesirable Outputs and Uncertainty. Adv. Oper. Res. 2024: 6905897:1-6905897:22 (2024)- [j53]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) - [j52]Ali Sahleh, Maziar Salahi:
Improved robust nonparallel support vector machines. Int. J. Data Sci. Anal. 17(1): 61-74 (2024) - [j51]Reza Feizabadi, Mehri Bagherian, Hamidreza Vaziri, Maziar Salahi:
PLEACH: a new heuristic algorithm for pure parsimony haplotyping problem. J. Supercomput. 80(6): 8236-8258 (2024) - 2023
- [j50]Tahereh Khodamoradi, Maziar Salahi:
Extended mean-conditional value-at-risk portfolio optimization with PADM and conditional scenario reduction technique. Comput. Stat. 38(2): 1023-1040 (2023) - [j49]Tahereh Khodamoradi, Maziar Salahi, Ali Reza Najafi:
Multi-intervals robust mean-conditional value-at-risk portfolio optimisation with conditional scenario reduction technique. Int. J. Appl. Decis. Sci. 16(2): 237-254 (2023) - [j48]Ali Sahleh, Maziar Salahi:
Relabeling Noisy Labels: A Twin SVM Approach. Oper. Res. Forum 4(4): 89 (2023) - [j47]Seyyedeh Faezeh Hassani Ziabari, Sadegh Eskandari, Maziar Salahi:
CInf-FSS: an efficient infinite feature selection method using K-means clustering to partition large feature spaces. Pattern Anal. Appl. 26(4): 1631-1639 (2023) - [j46]Ali Sahleh, Maziar Salahi, Sadegh Eskandari:
Multi-class nonparallel support vector machine. Prog. Artif. Intell. 12(4): 349-361 (2023) - 2022
- [j45]Rita Shakouri, Maziar Salahi:
Stochastic P-Robust Approach to a Centralized Two-Stage DEA System with Resource Waste. Adv. Oper. Res. 2022: 1133882:1-1133882:14 (2022) - [j44]Maziar Salahi, Ali Jamalian, Rita Shakouri, K. Asanimoghadam:
Additive Slack-Based Measure for a Two-Stage Structure with Shared Inputs and Undesirable Feedback. Adv. Oper. Res. 2022: 7596736:1-7596736:14 (2022) - [j43]Ali Sahleh, Maziar Salahi, Sadegh Eskandari:
SOCP approach to robust twin parametric margin support vector machine. Appl. Intell. 52(8): 9174-9192 (2022) - [j42]Saeid Ansary Karbasy, Maziar Salahi:
On the branch and bound algorithm for the extended trust-region subproblem. J. Glob. Optim. 83(2): 221-233 (2022) - [j41]Temadher Alassiry Al-Maadeed, Saeid Ansary Karbasy, Maziar Salahi, Abdelouahed Hamdi:
On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints. J. Optim. Theory Appl. 194(1): 246-264 (2022) - [j40]K. Asanimoghadam, Maziar Salahi, Ali Jamalian, Rita Shakouri:
A two-stage structure with undesirable outputs: slacks-based and additive slacks-based measures DEA models. RAIRO Oper. Res. 56(4): 2513-2534 (2022) - 2021
- [j39]Maziar Salahi, Mehdi Toloo, Narges Torabi:
A new robust optimization approach to common weights formulation in DEA. J. Oper. Res. Soc. 72(6): 1390-1402 (2021) - [j38]Saeid Ansary Karbasy, Abdelouahed Hamdi, Maziar Salahi, Akram Taati:
An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints. Optim. Lett. 15(4): 1425-1446 (2021) - [j37]Narges Torabi Golsefid, Maziar Salahi:
Efficiency decomposition in a three-stage network structure: Cooperative DEA, Nash bargaining game models and conic relaxations. RAIRO Oper. Res. 55(6): 3677-3699 (2021) - 2020
- [j36]Temadher Alassiry Al-Maadeed, Akram Taati, Maziar Salahi, Abdelouahed Hamdi:
The Generalized Trust-Region Sub-Problem with Additional Linear Inequality Constraints - Two Convex Quadratic Relaxations and Strong Duality. Symmetry 12(8): 1369 (2020) - 2019
- [j35]Saeid Ansary Karbasy, Maziar Salahi:
A hybrid algorithm for the two-trust-region subproblem. Comput. Appl. Math. 38(3) (2019) - [j34]Akram Taati, Maziar Salahi:
A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint. Comput. Optim. Appl. 74(1): 195-223 (2019) - [j33]Maziar Salahi, Mehdi Toloo, Zeynab Hesabirad:
Robust Russell and enhanced Russell measures in DEA. J. Oper. Res. Soc. 70(8): 1275-1283 (2019) - 2018
- [j32]Mehdi Toloo, Maziar Salahi:
A powerful discriminative approach for selecting the most efficient unit in DEA. Comput. Ind. Eng. 115: 269-277 (2018) - 2017
- [j31]Maziar Salahi, Mehdi Toloo:
In the determination of the most efficient decision making unit in data envelopment analysis: A comment. Comput. Ind. Eng. 104: 216-218 (2017) - [j30]Maziar Salahi, Akram Taati, Henry Wolkowicz:
Local nonglobal minima for solving large-scale extended trust-region subproblems. Comput. Optim. Appl. 66(2): 223-244 (2017) - [j29]Saeed Fallahi, Maziar Salahi:
Comments on "On the Indefinite Quadratic Fractional Optimization with Two Quadratic Constraints". J. Optim. Theory Appl. 175(1): 283-285 (2017) - [j28]Maziar Salahi:
Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem. Optim. Lett. 11(8): 1691-1697 (2017) - 2016
- [j27]Maziar Salahi, Saeed Fallahi:
Trust region subproblem with an additional linear inequality constraint. Optim. Lett. 10(4): 821-832 (2016) - 2015
- [j26]Maziar Salahi, Saeed Fallahi:
On the quadratic fractional optimization with a strictly convex quadratic constraint. Kybernetika 51(2): 293-308 (2015) - 2014
- [j25]Ali Jamalian, Maziar Salahi:
Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty. Appl. Math. Comput. 242: 179-186 (2014) - [j24]Maziar Salahi, Akram Taati:
Interior point gradient algorithm for totally nonnegative least-squares problems in inequality sense. Int. J. Comput. Math. 91(7): 1593-1600 (2014) - [j23]Saeed Fallahi, Maziar Salahi:
On the Indefinite Quadratic Fractional Optimization with Two Quadratic Constraints. J. Optim. Theory Appl. 162(1): 249-256 (2014) - 2013
- [j22]Hossein Aliabadi, Maziar Salahi:
Robust Geometric Programming Approach to Profit Maximization with Interval Uncertainty. Comput. Sci. J. Moldova 21(1): 86-96 (2013) - [j21]Maziar Salahi, Saeed Fallahi:
Linear fractional program under interval and ellipsoidal uncertainty. Kybernetika 49(1): 181-187 (2013) - [j20]Maziar Salahi, Ali Jamalian, Akram Taati:
Global minimization of multi-funnel functions using particle swarm optimization. Neural Comput. Appl. 23(7-8): 2101-2106 (2013) - 2011
- [j19]Maziar Salahi:
Regularization tools and robust optimization for ill-conditioned least squares problem: A computational comparison. Appl. Math. Comput. 217(20): 7985-7990 (2011) - [j18]Maziar Salahi:
Optimal Correction of Infeasible Systems in the Second Order Conic Linear Setting. Comput. Sci. J. Moldova 19(1): 72-79 (2011) - 2010
- [j17]Maziar Salahi:
Robust least squares solution of linear inequalities. Appl. Math. Lett. 23(5): 605-608 (2010) - [j16]Maziar Salahi:
Convex optimization approach to a single quadratically constrained quadratic minimization problem. Central Eur. J. Oper. Res. 18(2): 181-187 (2010) - [j15]Hossein Aminikhah, Maziar Salahi:
A new homotopy perturbation method for system of nonlinear integro-differential equations. Int. J. Comput. Math. 87(5): 1186-1194 (2010) - [j14]Maziar Salahi:
An adaptive long step interior point algorithm for linear optimization. Kybernetika 46(4): 722-729 (2010) - [j13]Maziar Salahi, Saeed Ketabchi:
Correcting an inconsistent set of linear inequalities by the generalized Newton method. Optim. Methods Softw. 25(3): 457-465 (2010) - 2009
- [j12]Maziar Salahi:
A short note on minx in Rn(||Ax-b||2 / 1+||x||2). Appl. Math. Comput. 212(1): 270-272 (2009) - [j11]Maziar Salahi, Tamás Terlaky:
A Hybrid Adaptive Algorithm for Linear Optimization. Asia Pac. J. Oper. Res. 26(2): 235-256 (2009) - [j10]Maziar Salahi, Hossein Zareamoghaddam:
Computational Experiments on the Tikhonov Regularization of the Total Least Squares Problem. Comput. Sci. J. Moldova 17(1): 14-25 (2009) - [j9]Saeed Ketabchi, Maziar Salahi:
Correcting Inconsistency in Linear Inequalities by Minimal Change in the Right Hand Side Vector. Comput. Sci. J. Moldova 17(2): 179-192 (2009) - 2008
- [j8]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) - [j7]Maziar Salahi, Tamás Terlaky:
Mehrotra-type predictor-corrector algorithm revisited. Optim. Methods Softw. 23(2): 259-273 (2008) - 2007
- [j6]Maziar Salahi:
A finite termination Mehrotra-type predictor-corrector algorithm. Appl. Math. Comput. 190(2): 1740-1746 (2007) - [j5]Maziar Salahi, Tamás Terlaky:
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms. Eur. J. Oper. Res. 182(2): 502-513 (2007) - [j4]Maziar Salahi, Jiming Peng, Tamás Terlaky:
On Mehrotra-Type Predictor-Corrector Algorithms. SIAM J. Optim. 18(4): 1377-1397 (2007) - 2006
- [j3]Maziar Salahi, Nezam Mahdavi-Amiri:
Polynomial time second order Mehrotra-type predictor-corrector algorithms. Appl. Math. Comput. 183(1): 646-658 (2006) - [j2]Maziar Salahi, Tamás Terlaky, Guoqing Zhang:
The Complexity of Self-Regular Proximity Based Infeasible IPMs. Comput. Optim. Appl. 33(2-3): 157-185 (2006) - 2005
- [j1]Maziar Salahi, Tamás Terlaky:
An adaptive self-regular proximity-based large-update IPM for LO. Optim. Methods Softw. 20(1): 169-185 (2005)
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-05-08 21:53 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:
