Maziar Salahi

Orcid: 0000-0002-0430-3063

According to our database1, Maziar Salahi authored at least 54 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
PLEACH: a new heuristic algorithm for pure parsimony haplotyping problem.
J. Supercomput., April, 2024

A penalty decomposition algorithm for the extended mean-variance-CVaR portfolio optimization problem.
Discret. Math. Algorithms Appl., April, 2024

Improved robust nonparallel support vector machines.
Int. J. Data Sci. Anal., January, 2024

Malmquist-Luenberger Productivity Index for a Two-Stage Structure in the Presence of Undesirable Outputs and Uncertainty.
Adv. Oper. Res., 2024

2023
Multi-class nonparallel support vector machine.
Prog. Artif. Intell., December, 2023

Relabeling Noisy Labels: A Twin SVM Approach.
Oper. Res. Forum, December, 2023

CInf-FS<sub>S</sub>: an efficient infinite feature selection method using K-means clustering to partition large feature spaces.
Pattern Anal. Appl., November, 2023

Extended mean-conditional value-at-risk portfolio optimization with PADM and conditional scenario reduction technique.
Comput. Stat., June, 2023

Multi-intervals robust mean-conditional value-at-risk portfolio optimisation with conditional scenario reduction technique.
Int. J. Appl. Decis. Sci., 2023

2022
A two-stage structure with undesirable outputs: slacks-based and additive slacks-based measures DEA models.
RAIRO Oper. Res., 2022

On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints.
J. Optim. Theory Appl., 2022

On the branch and bound algorithm for the extended trust-region subproblem.
J. Glob. Optim., 2022

SOCP approach to robust twin parametric margin support vector machine.
Appl. Intell., 2022

Stochastic P-Robust Approach to a Centralized Two-Stage DEA System with Resource Waste.
Adv. Oper. Res., 2022

Additive Slack-Based Measure for a Two-Stage Structure with Shared Inputs and Undesirable Feedback.
Adv. Oper. Res., 2022

2021
Efficiency decomposition in a three-stage network structure: Cooperative DEA, Nash bargaining game models and conic relaxations.
RAIRO Oper. Res., 2021

An efficient algorithm for large-scale extended trust-region subproblems with non-intersecting linear constraints.
Optim. Lett., 2021

A new robust optimization approach to common weights formulation in DEA.
J. Oper. Res. Soc., 2021

2020
The Generalized Trust-Region Sub-Problem with Additional Linear Inequality Constraints - Two Convex Quadratic Relaxations and Strong Duality.
Symmetry, 2020

2019
Robust Russell and enhanced Russell measures in DEA.
J. Oper. Res. Soc., 2019

A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint.
Comput. Optim. Appl., 2019

A hybrid algorithm for the two-trust-region subproblem.
Comput. Appl. Math., 2019

2018
A powerful discriminative approach for selecting the most efficient unit in DEA.
Comput. Ind. Eng., 2018

2017
Exact two steps SOCP/SDP formulation for a modified conic trust region subproblem.
Optim. Lett., 2017

Comments on "On the Indefinite Quadratic Fractional Optimization with Two Quadratic Constraints".
J. Optim. Theory Appl., 2017

Local nonglobal minima for solving large-scale extended trust-region subproblems.
Comput. Optim. Appl., 2017

In the determination of the most efficient decision making unit in data envelopment analysis: A comment.
Comput. Ind. Eng., 2017

2016
Trust region subproblem with an additional linear inequality constraint.
Optim. Lett., 2016

2015
On the quadratic fractional optimization with a strictly convex quadratic constraint.
Kybernetika, 2015

2014
On the Indefinite Quadratic Fractional Optimization with Two Quadratic Constraints.
J. Optim. Theory Appl., 2014

Interior point gradient algorithm for totally nonnegative least-squares problems in inequality sense.
Int. J. Comput. Math., 2014

Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty.
Appl. Math. Comput., 2014

2013
Global minimization of multi-funnel functions using particle swarm optimization.
Neural Comput. Appl., 2013

Linear fractional program under interval and ellipsoidal uncertainty.
Kybernetika, 2013

Robust Geometric Programming Approach to Profit Maximization with Interval Uncertainty.
Comput. Sci. J. Moldova, 2013

2011
Optimal Correction of Infeasible Systems in the Second Order Conic Linear Setting.
Comput. Sci. J. Moldova, 2011

Regularization tools and robust optimization for ill-conditioned least squares problem: A computational comparison.
Appl. Math. Comput., 2011

2010
Correcting an inconsistent set of linear inequalities by the generalized Newton method.
Optim. Methods Softw., 2010

An adaptive long step interior point algorithm for linear optimization.
Kybernetika, 2010

A new homotopy perturbation method for system of nonlinear integro-differential equations.
Int. J. Comput. Math., 2010

Convex optimization approach to a single quadratically constrained quadratic minimization problem.
Central Eur. J. Oper. Res., 2010

Robust least squares solution of linear inequalities.
Appl. Math. Lett., 2010

2009
Computational Experiments on the Tikhonov Regularization of the Total Least Squares Problem.
Comput. Sci. J. Moldova, 2009

Correcting Inconsistency in Linear Inequalities by Minimal Change in the Right Hand Side Vector.
Comput. Sci. J. Moldova, 2009

A Hybrid Adaptive Algorithm for Linear Optimization.
Asia Pac. J. Oper. Res., 2009

A short note on min<sub>x in R<sup>n</sup></sub>(||Ax-b||<sup>2</sup> / 1+||x||<sup>2</sup>).
Appl. Math. Comput., 2009

2008
Mehrotra-type predictor-corrector algorithm revisited.
Optim. Methods Softw., 2008

New complexity analysis of IIPMs for linear optimization based on a specific self-regular function.
Eur. J. Oper. Res., 2008

2007
On Mehrotra-Type Predictor-Corrector Algorithms.
SIAM J. Optim., 2007

Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms.
Eur. J. Oper. Res., 2007

A finite termination Mehrotra-type predictor-corrector algorithm.
Appl. Math. Comput., 2007

2006
The Complexity of Self-Regular Proximity Based Infeasible IPMs.
Comput. Optim. Appl., 2006

Polynomial time second order Mehrotra-type predictor-corrector algorithms.
Appl. Math. Comput., 2006

2005
An adaptive self-regular proximity-based large-update IPM for LO.
Optim. Methods Softw., 2005


  Loading...