The Strength Pareto Gravitational Search Algorithm (SPGSA) to solve Economic Load Dispatch (ELD) is presents this paper with various generator constraints in power systems. The ELD problem in a power system is to determine the optimal combination of power outputs for all generating units which will minimize the total fuel cost while satisfying all practical constraints. For practical generator ...

In this paper, an Economic Dispatch (ED) model is developed for the system consisting of both thermal generators and wind turbines. The inclusion of a significant amount of wind energy into power systems has resulted in additional constraints on ED to accommodate the intermittent nature of the output. The probability of stochastic wind power based on the Weibull probability density function is ...

The purpose of this paper is to present the extended version of the conventional DEED to overcome the ramp rate violations when its optimal solutions for one period (normally one day) are implemented repeatedly and periodically over consequent dispatch periods to meet the periodic load demands. This dynamic dispatch problem, which is referred to as EDEED, is a multi-objective optimization probl...

We show that it is possible to obtain a linear computational cost FEM-based solver for non-stationary Stokes and Navier-Stokes equations. Our method employs technique developed by Guermond Minev, which consists of singular perturbation plus splitting scheme. While the time-integration schemes are implicit, we use finite elements discretize spatial counterparts. At each time-step, solve PDE havi...

Abstract. Optimal control problems with convex but non-smooth cost functional are considered. The non-smoothness arises from a L-norm in the objective functional, which recently attracted much research effort in the context of inverse problems. The problem is regularized to permit the use of semi-smooth Newton method. Error estimates with respect to the regularization parameter are provided. Mo...

"Real continuous submodular functions, as a generalization of the corresponding discrete notion to domain, gained considerable attention recently. The analog for entropy functions requires additional properties: real function defined on non-negative orthant $\R^n$ is entropy-like (EL) if it submodular, takes zero at zero, non-decreasing, and has Diminishing Returns property. Motivated by proble...

We study joint chance constrained programs (JCCPs). JCCPs are often non-convex and non-smooth, and thus are generally challenging to solve. In this paper, we propose a logarithmsum-exponential smoothing technique to approximate a joint chance constraint by the difference of two smooth convex functions and use a sequential convex approximation algorithm, coupled with a Monte Carlo method, to sol...

One method of solving the single-image super-resolution problem is to use Heaviside functions. This has been done previously by making a binary classification of image components as "smooth" and "non-smooth", describing these with approximated Heaviside functions (AHFs), and iteration including l1 regularization. We now introduce a new method in which the binary classification of image componen...