Compressed sensing (CS) shows that a signal having a sparse or compressible representation can be recovered from a small set of linear measurements. In classical CS theory, the sampling matrix and dictionary are assumed be known exactly in advance. However, uncertainties exist due to sampling distortion, finite grids of the parameter space of dictionary, etc. In this paper, we take a generalize...

In this paper the parametric study is carried out to investigate the effect of number of cells in optimal cost of the non-prismatic reinforced concrete (RC) box girder bridges. The variables are geometry of cross section, tapered length, concrete strength and reinforcement of the box girders and slabs that are obtained using ECBO metaheuristic algorithm. The design is based on AASHTO standard s...

In this paper, we define a distributionally robust k-sum optimization problem as the problem of finding a solution that minimizes the worst-case expected sum of up to the k largest costs of the elements in the solution. The costs are random with a joint probability distribution that is not completely specified but rather assumed to be known to lie in a set of probability distributions. For k = ...

Robust portfolio optimization has been developed to resolve the high sensitivity to inputs of the Markowitz mean-variance model. Although much effort has been put into forming robust portfolios, there have not been many attempts to analyze the characteristics of portfolios formed from robust optimization. We investigate the behavior of robust portfolios by analytically describing how robustness...

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possible situation that could arise, out of an uncertainty set of possible situation...

The DIRECT (DIviding RECTangles) algorithm of Jones, Perttunen, and Stuckman (Journal of Optimization Theory and Applications, vol. 79, no. 1, pp. 157–181, 1993), a variant of Lipschitzian methods for bound constrained global optimization, has proved effective even in higher dimensions. However, the performance of a DIRECT implementation in real applications depends on the characteristics of th...

We present a new method for solving the box-constrained stochastic linear variational inequality problem with three special types of uncertainty sets. Most previous methods, such as the expected value and expected residual minimization, need the probability distribution information of the stochastic variables. In contrast, we give the robust reformulation and reformulate the problem as a quadra...

The present paper addresses an effective cyber defense model by applying information fusion based game theoretical approaches‎. ‎In the present paper, we are trying to improve previous models by applying stochastic optimal control and robust optimization techniques‎. ‎Jump processes are applied to model different and complex situations in cyber games‎. ‎Applying jump processes we propose some m...

in this paper, we consider a multi-site production planning problem subject to uncertainty in demand and workforce expenses. in our new mathematical model, we presented a production planning system considering failure in rework and breakdown. we also survey human workforce allocation and its expenses which are considered uncertain due to some tradeoff between company’s benefits and workforce :u...

Both multiple objectives and computation-intensive black-box functions often exist simultaneously in engineering design problems. Few of existing multi-objective optimization approaches addresses problems with expensive black-box functions. In this paper, a new method called the Pareto set pursuing (PSP) method is developed. By developing sampling guidance functions based on approximation model...