# Nezam Mahdavi-AmiriSharif University of Technology | SHARIF · Department of Mathematical Science

Nezam Mahdavi-Amiri

Ph.D.

## About

223

Publications

29,162

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

2,686

Citations

Introduction

Additional affiliations

January 2014 - present

January 2014 - present

January 2001 - December 2013

Education

June 1978 - November 1981

September 1976 - May 1978

September 1973 - May 1976

## Publications

Publications (223)

We propose a time-varying dual accelerated gradient method for minimizing the average of n strongly convex and smooth functions over a time-varying network with n nodes. We prove that the time-varying dual accelerated gradient ascent method converges at an R-linear rate with the time to reach an ϵ-neighborhood of the solution being of O(1ln(1/c)ln...

Orthogonal Nonnegative Matrix Factorization (ONMF) with orthogonality constraints on a matrix has been found to provide better clustering results over existing clustering problems. Because of the orthogonality constraint, this optimization problem is difficult to solve. Many of the existing constraint-preserving methods deal directly with the const...

Partitioning a given data-set into subsets based on similarity among the data is called clustering. Clustering is a major task in data mining and machine learning having many applications such as text retrieval, pattern recognition, and web mining. Here, we briefly review some clustering related problems (k-means, normalized k-cut, orthogonal non-n...

In recent years, the number and severity of natural disasters occurring in various regions of the world have increased dramatically incurring heavy financial and human losses. Therefore, decision-makers have been concerned with ways of providing relief to reduce the losses. Here, we present a multi-objective bi-level model for disaster location-rou...

Melanoma is the deadliest type of human skin cancer. However, it is curable if diagnosed in an early stage. Recently, computer aided diagnosis (CAD) systems have drawn much interests. Segmentation is a crucial step of a CAD system. There are different types of skin lesions having high similarities in terms of color, shape, size and appearance. Most...

A new mixed-integer nonlinear programming model is presented for the time-dependent vehicle routing problem with time windows and intelligent travel times. The aim is to minimize fixed and variable costs, with the assumption that the travel time between any two nodes depends on traffic conditions and is considered to be a function of vehicle depart...

Some efficient interior-point methods (IPMs) are based on using a self-concordant barrier function related to the feasibility set of the underlying problem.Here, we use IPMs for solving fractional programming problems involving second order cone constraints. We propose a logarithmic barrier function to show the self concordant property and present...

We propose an inexact nonmonotone successive quadratic programming (SQP) algorithm for solving nonlinear programming problems with equality constraints and bounded variables. Regarding the value of the current feasibility violation and the minimum value of its linear approximation over a trust region, several scenarios are envisaged. In one scenari...

Here, a fuzzy multi-period multi-echelon multi-objective mixed-integer non-linear programming (MOMINLP) model is considered for a sustainable multi-product multi-site multi-distribution multi-customer supply chain in forward flow having multi-centers for collecting, checking, repairing and decomposing and multi-disposal centers in the reverse flow....

We consider a median location problem in the presence of two probabilistic line barriers on the plane under rectilinear distance. It is assumed that the two line barriers move on their corresponding horizontal routes uniformly. We first investigate different scenarios for the position of the line barriers on the plane and their corresponding routes...

An inexact nonmonotone filter sequential quadratic programming algorithm is presented for solving general constrained nonlinear programming problems. At every iteration, a steering direction is computed as a minimizer of a linear model of the constraint violation over a trust region. A possible infeasible stationary point can be detected using the...

Recently, Ghanbari et al. (IEEE Transactions on Fuzzy Systems 27:1286–1294, 2019) have proposed modified Kerre’s method for comparison of LR fuzzy numbers. Here, we make use of the modified Kerre’s method to solve fuzzy linear programming problems with LR coefficients. In an approach to solve a fuzzy linear program with fuzzy LR coefficients, a bi-...

In this paper, a full-Newton step Interior-Point Method for solving monotone Weighted Linear Complementarity Problem is designed and analyzed. This problem has been introduced recently as a generalization of the Linear Complementarity Problem with modified complementarity equation, where zero on the right-hand side is replaced with the nonnegative...

Public Bicycle Sharing System (PBSS) is used as a way to reduce traffic and pollution in cities. Its performance is related to availability of bicycles for picking up and free docks to return them. Existence of different demand types leads to the emergence of imbalanced stations. Here, we try to balance inventory of stations via defining maximal re...

We investigate various types of fuzzy linear programming problems based on models and solution methods. First, we review fuzzy linear programming problems with fuzzy decision variables and fuzzy linear programming problems with fuzzy parameters (fuzzy numbers in the definition of the objective function or constraints) along with the associated dual...

Recently, public bicycle sharing system (PBSS) has become one of the most favorite urban transportation systems that can help governments to decrease environmental problems such as pollution and traffic. This paper studies a sharing system that includes two types of stations. The first category contains stations that users can rent or return back b...

Green products are increasingly considered by companies, owing to the significant attention of government regulations, customers’ requests and competitors. Here, we deal with Green Product Families (GPFs) by selecting green components, modules and products which are produced based on the assembling to order (ATO) approach to cover diverse customer...

We formulate an integrated mathematical model for distribution of the injured on a three-type transportation network with destroyable independent links and with actual travel times considering two different groups of the injured. The aim is to find the temporary locations for aid stations and their capacities, the percentage of the injured with var...

We propose and analyse a nonmonotone quasi-Newton algorithm for unconstrained strongly convex multiobjective optimization. In our method, we allow for the decrease of a convex combination of recent function values. We establish the global convergence and local superlinear rate of convergence under reasonable assumptions. We implement our scheme in...

We present a feasible full step interior-point algorithm to solve the P∗(κ) horizontal linear complementarity problem defined on a Cartesian product of symmetric cones, which is not based on a usual barrier function. The full steps are scaled utilizing the Nesterov-Todd (NT) scaling point. Our approach generates the search directions leading to the...

In a stochastic-flow network, a (d, T, b, P 1 , P 2 )-MP is a system state vector for which d units of flow can be transmitted through two separate minimal paths (SMPs) P1 and P2 simultaneously from a source node to a sink node satisfying time and budget limitations T and b, respectively. Problem of determining all the (d, T, b, P 1 , P 2 )-MPs, te...

We present an algorithm for minimizing locally Lipschitz functions being continuously differentiable in an open dense subset of \(\mathbb {R}^n\). The function may be nonsmooth and/or nonconvex. The method makes use of a gradient sampling method along with a conjugate gradient scheme. To find search directions, we make use of a sequence of positive...

This article deals with product Family: a group of products with similar modules produced based on assembling to order (ATO) approach to cover diverse customer needs. The demand level and the customer requirements of these products are dynamically changing, which necessitate a novel model for co-reconfiguration of the product family (PF) and the su...

Public Bicycle Sharing System has recently been developed and installed in many cities as a workable and popular transportation system. There are still some noticeable challenges associated with the operation of the system, like responding to all renting requests and all demands of vacant docks for returning bikes. Balancing the inventory of statio...

To solve a fuzzy optimization problem, we need to compare fuzzy numbers. Here, we make use of our recently proposed modified Kerre’s method as an effective approach for comparison of LR fuzzy numbers. Using our new results on LR fuzzy numbers, we show that to compare two LR fuzzy numbers, we do not need to compute the fuzzy maximum of two numbers d...

Today, organizations try to decline academically expenses using humans and resources in addition to rising managers and operators' satisfaction. Meantime, a very important step in the process of decision is the assignment of human resources, particularly in connection with research and development (R&D) projects in which the system is highly depend...

We establish some necessary conditions (of the primal and dual types) for the set of weak sharp minima of a nonconvex optimization problem on a Riemannian manifold. Here, we provide a generalization of some characterizations of weak sharp minima for convex problems on Riemannian manifold introduced by Li et al. (SIAM J Optim 21(4):1523–1560, 2011)...

Abaffy, Broyden and Spediacto (ABS) introduced a class of the so-called ABS methods to solve systems of linear equations. The ABS approach was specialized to solve linear Diophantine systems by Esmaeili, Mahdavi-Amiri and Spedicato. The method was extended to systems of certain linear inequalities to provide all solutions. Here, we mainly focus on...

We propose a modified structured secant relation to get a more accurate approximation of the second curvature of the least squares objective function. Then, using this relation and an approach introduced by Andrei, we propose three scaled nonlinear conjugate gradient methods for nonlinear least squares problems. An attractive feature of one of the...

In this paper, we develop a stochastic programming model for the capacitated location-allocation problem in the heterogeneous environment where the demands are distributed according to the Bernoulli function with different probabilities. The capacitated sub-sources of facilities are also involved to satisfy customers’ demands in this work. This stu...

Background and objectives:
Melanoma is a dangerous kind of skin disease with a high death rate, and its prevalence has increased rapidly in recent years. Diagnosis of melanoma in a primary phase can be helpful for its cure. Due to costs for dermatology, we need an automatic system to diagnose melanoma through lesion images.
Methods:
Here, we pro...

A bi-objective stochastic capacitated multi-facility location–allocation problem is presented where the customer demands have Bernoulli distributions. The capacity of a facility for accepting customers is limited so that if the number of allocated customers to the facility is more than its capacity, a shortage will occur. The problem is formulated...

In recent decades, multistate two-terminal reliability problem has attracted several researchers, and accordingly many exact and approximation approaches have been proposed in the literature in terms of minimal cuts (MCs) or minimal paths (MPs) to address this problem. Here, an MP-based approximation approach is developed based on exact algorithms....

We develop a linear ranking function for ordering bipolar fuzzy numbers and study its properties. Using this ranking function, we solve a bipolar fuzzy linear programing problem. Then, we present the dual of the problem and establish several duality results. Also, we presented an application of bipolar fuzzy number in real life problem.

We are to establish necessary conditions (of the primal and dual types) for the set of weak sharp minima of a nonconvex optimization problem on a Riemannian manifold. Here, we are to provide a generalization of some characterizations of weak sharp minima for convex problems on Riemannian manifold introduced by Li et al. (SIAM J. Optim., 21 (2011),...

We present an infeasible interior-point predictor–corrector algorithm, based on a large neighborhood of the central path, for horizontal linear complementarity problem over the Cartesian product of symmetric cones. Throughout the paper, we assume that a certain property holds for the above-mentioned problem. This condition is equivalent to the prop...

We consider the stochastic queue core problem on a tree network. Our aim is to find an optimal path on a tree network subject to the average travel time of particles moving along the tree for service given by a server traversing along the optimal path. We assume that particles originating at a node on a tree network request their demands for servic...

Natural gas is generally transmitted from production to consumption areas through an infrastructure of pipelines consisting of three separate networks, namely transmission, feeding, and distribution. The transmission network delivers high-pressure gas near the main consumption areas, and feeding and distribution networks reduce the gas pressure in...

In this article, a methodology is developed to solve an interval and a fractional interval programming problem by converting into a non-interval form for second order cone constraints, with the objective function and constraints being interval valued functions. We investigate the parametric and non-parametric forms of the interval valued functions...

We study a location-allocation-routing problem for distribution of the injured in a disaster response scenario, considering a three-type transportation network with separate links. A circle-based approach to estimate the impacts of the disaster is presented. After formulating relations for computing the percentage of the injured, the destruction pe...

To solve a fuzzy linear program, we need to compare fuzzy numbers. Here, we make use of our recently proposed modified Kerre's method for comparison of LR fuzzy numbers. We give some new results on LR fuzzy numbers and show that to compare two LR fuzzy numbers, we do not need to compute the fuzzy maximum of two numbers directly. Using the modified...

We present a primal-dual predictor-corrector interior-point method for symmetric cone optimization. The proposed algorithm is based on the Nesterov-Todd search directions and a wide neighborhood, which is an even wider neighborhood than a given negative infinity neighborhood. At each iteration, the method computes two corrector directions in additi...

Here, we refine our recent proposed method for computing a positive definite solution to an overdetermined linear system of equations with multiple right-hand sides. This problem is important in several process control contexts including quadratic models for optimal control. The coefficient and the right-hand side matrices are, respectively, named...

We propose a new method for ordering bipolar fuzzy numbers. In this method, for comparison of bipolar LR fuzzy numbers, we use an extension of Kerre’s method being used in ordering of unipolar fuzzy numbers. We give a direct formula to compare two bipolar triangular fuzzy numbers in O(1) operations, making the process useful for many optimization a...

The authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer bi-level mathematical problem, based on the concept of reserve capacity. The upper level goal is to maximize the reserve capacity by signal settings at intersections, determine street direction and increase street capacities via addition of lanes. The lo...

We propose an approach for computing the product of various fuzzy numbers using a-cuts. A regression model is used to obtain the membership function of the product. Then, we make use of the approach to compute solutions of fully fuzzy linear systems. We also show how to compute solutions of fully fuzzy linear systems with various fuzzy variables. E...

Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain param...

Recently, Luc defined a dual program for a multiple objective linear program. The dual problem is also a multiple objective linear problem and the weak duality and strong duality theorems for these primal and dual problems have been established. Here, we use these results to prove some relationships between multiple objective linear primal and dual...

A utility function is an important tool for representing a DM’s preference. We adjoin utility functions to multi-objective optimization problems. In current studies, usually one utility function is used for each objective function. Situations may arise for a goal to have multiple utility functions. Here, we consider a constrained multi-objective pr...

We present a competitive algorithm to minimize a locally Lipschitz function constrained with locally Lipschitz constraints. The approach is to use an ℓ1 nonsmooth penalty function. The method generates second order descent directions to minimize the ℓ1 penalty function. We introduce a new criterion to decide upon acceptability of a Goldstein subdif...

It is possible to define multiresolution by reversing the process of subdivision. One approach to reverse a subdivision scheme appropriates pure numerical algebraic relations for subdivision using the interaction of diagrams [1, 2]. However, certain assumptions carried through the available work, two of which we wish to challenge: (1) the construct...

The authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer bi-level mathematical problem, based on the concept of reserve capacity. The upper level goal is to maximize the reserve capacity by signal settings at intersections, determine street direction and increase street capacities via addition of lanes. The lo...

We provide a mixed-integer nonlinear programming (MINLP) model for a location-allocation-routing problem in a transportation network with links carrying the travel times among the nodes in the network. The travel time between two nodes is considered to be intelligent, that is, since the travelling population in a link can affect the travel time, he...

Group working has an important role in cellular manufacturing systems (CMS) as they can affect the work environment and job executions on machines. The most important factors affecting human resources are aspects of ability and interactional interest among workers in workshops. Here, we present a simple and efficient method considering these two as...

In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three-centering steps. Here, each iteration consists of only a feasibility step. Thus, the new algorithm demands less work in each iteration and admits a simple analysis of complexity bound. The complexity result coincides with the best-known itera...

We present a new bi-objective model for vehicle routing problem with partial delivery and time windows considering customer’s satisfaction. Objectives are to maximize the customer satisfaction and minimize the travel time. Hard time windows and the possibility of multiple visits are considered and the customer needs could be more than the vehicle’s...

In recent years, big data has usefully been deployed by organizations with the aim of getting a better prediction for the future. Moreover, knowledge management systems are being used by organizations to identify and create knowledge. Here, the output from analysis of big data and a knowledge management system are used to develop a new model with t...

Creative organizations needing teams to combine and integrate inputs from other teams, the teams' structure of interaction is an important prerequisite for creativity. Here, the authors investigate different structural aspects teams' network organization and their creativity within a knowledge development program (KDP). Initially, a pilot group of...

The quickest path reliability problem evaluates the probability of transmitting some given units of flow from a source node to a sink node through a single minimal path in a stochastic-flow network within some specified units of time. This problem has been recently extended to the case of transmitting flow through q separate minimal paths (SMPs) si...

A main component of a transportation network is travel time or distance. Due to stochastic events such as accidents and failures in roads, a deterministic estimation of the travel time between two cities or regions is impossible. Also, on special occasions like holidays, with increase in the traveling population in the transportation network, proba...

We propose modified hybridizations of genetic algorithms with some neighborhood search based metaheuristics. In our hybrid algorithms, we consider gradually increasing probability for the application of the neighborhood search procedure on the best individuals as the number of iterations of the genetic algorithm increases. We implement the proposed...

Reliability evaluation of a stochastic-flow network (SFN) has been extensively studied in the past decades and various algorithms have been proposed. A number of graph based algorithms are in terms of minimal paths (MPs). Most MP-based algorithms have been proposed for the case of single-source single-sink SFN and a few algorithms have considered t...

Purpose
– The purpose of this paper is to propose a Meta modeling based on regression, neural network, and clustering to analyze the job satisfaction factors and improvement policy making.
Design/methodology/approach
– Since any job satisfaction evaluation supposes to improve the status by prescribing specific strategies to be performed in the org...

We address the two-stage assembly scheduling problem where there are m machines at the first stage and n assembly machines at the second stage under lot sizing environment. Lot streaming (lot sizing) means breaking a lot into some sublots, where each sublot is transferred to the next machine for continuing operations. This problem can be considered...

The d-MinCut (d-MC) problem has been extensively studied in the past decades and various algorithms have been proposed. The existing algorithms often consist of two general stages, finding all the d-MC candidates and testing each candidate for being a d-MC. To find all the d-MC candidates, a system of equations and inequalities should be solved. He...

Similarity measures are very important concepts in fuzzy sets theory. There are several definitions for similarity measures in both type-1 and interval type-2 fuzzy sets (IT2-FSs). Here, the problem of finding similarity between two IT2-FSs is considered. A new similarity measure is proposed and its performance is compared with existing approaches...

Similarity measures are very important concepts in fuzzy sets theory. There are several definitions for similarity measures in both type-1 and interval type-2 fuzzy sets (IT2-FSs). Here, the problem of finding similarity between two IT2-FSs is considered. A new similarity measure is proposed and its performance is compared with existing approaches...

Here, a capacitated location-multi-allocation-routing problem with intelligent stochastic travel times is considered. In our study, the concept of intelligent stochastic travel times incurs two issues: (1) consideration of some random factors in computing the travel times and (2) impact of the traveling population on these random factors simultaneo...

In this study, we consider a capacitated location–multi-allocation–routing problem with population-dependent random travel times. The objective is to find appropriate locations as server locations among the candidate locations, allocate the existing population in each demand node to server locations, and determine the movement path of each member t...

The need to estimate a positive definite solution to an overdetermined linear system of equations with multiple right hand side vectors arises in several process control contexts. The coefficient and the right hand side matrices are respectively named data and target matrices. A number of optimization methods were proposed for solving such problems...