The purpose of this paper is to characterize the weak Pareto optimality for multiobjective pseudoconvex problem. In fact, it is a first order optimality characterization that generalize the Karush-Kuhn-Tucker condition. Moreover, this work is an extension of the single-objective case [6] to the multiobjective one with pseudoconvex continuous functions. Mathematics Subject Classification: 46N10,...

In this paper, we propose an effective iterative preconditioning method to solve elliptic problems with jumps in coefficients. The algorithm is based on the additive Schwarz method (ASM). First, we consider a domain decomposition method without ‘cross points’ on interfaces between subdomains and the second is the ‘cross points’ case. In both cases the main computational cost is an implementatio...

The aim of this paper is to analyze total factor productivity (TFP) growth and its components in Asian countries applying Stochastic Frontier Analysis (SFA) to the time series data of 44 Asian countries from 2000 to 2010. Using Battese and Coelli approach, TFP is divided into technical efficiency change and technical change. TFP decomposition using SFA method for the years 1998 to 2007 indicate...

Nano-CuFe2O4 catalysts with different Cu/Fe molar ratios (CunFemO(n+1.5m)) were prepared by hydrothermal method. The thermal decomposition performance of CunFemO(n+1.5m) on CuSO4 were determined with TG-DSC method to evaluate its catalytic activity and the roasted product was characterized by ...

This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-...

the aim of this paper is to analyze total factor productivity (tfp) growth and its components in asian countries applying stochastic frontier analysis (sfa) to the time series data of 44 asian countries from 2000 to 2010. using battese and coelli approach, tfp is divided into technical efficiency change and technical change. tfp decomposition using sfa method for the years 1998 to 2007 indicate...

In numerical time-integration with implicit-explicit (IMEX) methods, a within-step adaptable decomposition called residual balanced decomposition is introduced. This decomposition allows any residual occurring in the implicit equation of the implicit-step to be moved into the explicit part of the decomposition. By balancing the residual, the accuracy of the local truncation error of the time-st...

In this paper we investigate the construction of efficient secret sharing schemes by using a technique called hypergraph decomposition, extending in a non-trivial way the previously studied graph decomposition technique. A major advantage advantage of hypergraph decomposition is that it applies to any access structure, rather than only structures representable as graphs. As a consequence we obt...

The computational complexity of one-dimensional time fractional reaction-diffusion equation is O(N²M) compared with O(NM) for classical integer reaction-diffusion equation. Parallel computing is used to overcome this challenge. Domain decomposition method (DDM) embodies large potential for parallelization of the numerical solution for fractional equations and serves as a basis for distributed, ...

Lagrangean decomposition has been recognized as a promising approach for solving large-scale optimization problems. However, Lagrangean decomposition is critically dependent on the method of updating the Lagrangean multipliers used to decompose the original model. This paper presents a Lagrangean decomposition approach based on Nelder–Mead optimization algorithm to update the Lagrangean multipl...