Location theory is an interstice field of optimization and operations research‎. ‎In the classic location models‎, ‎the goal is finding the location of one or more facilities such that some criteria such as transportation cost‎, ‎the sum of distances passed by clients‎, ‎total service time, and cost of servicing are minimized‎. ‎The goal Weber location problem is a special case of location mode...

In this paper we study penalized regression splines (P-splines), which are low–order basis splines with a penalty to avoid undersmoothing. Such P–splines are typically not spatially adaptive, and hence can have trouble when functions are varying rapidly. Our approach is to model the penalty parameter inherent in the P–spline method as a heteroscedastic regression function. We develop a full Bay...

Abstract— The sequence alignment is the one of the most fundamental technique of nowaday molecular biology. Computer scientists mapped it into the longest common sequence (LCS) problem which is a well-studied problem in algorithms. The optimal alignment score of LCS can be found in O(n1n2) time with the dynamic programming technique, where n1 and n2 is the lengths of the two sequences. Scientis...

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

We consider nonlinear optimization programs with matrix inequality constraints, also known as nonlinear semidefinite programs. We prove local convergence for an augmented Lagrangian method which uses smooth spectral penalty functions. The sufficient second-order no-gap optimality condition and a suitable implicit function theorem are used to prove local linear convergence without the need to dr...

We consider high-dimensional generalized linear models with Lipschitz loss functions, and prove a nonasymptotic oracle inequality for the empirical risk minimizer with Lasso penalty. The penalty is based on the coefficients in the linear predictor, after normalization with the empirical norm. The examples include logistic regression, density estimation and classification with hinge loss. Least ...

This paper deals with a multi-agent-based interval type-2 fuzzy (IT2F) expert systemfor scheduling steel continuous casting. Continuous caster scheduling is a complex and extensiveprocess that needs expert staff. In this study, a distributed multi-agent-based structure is proposed as asolution. The agents used herein can cooperate with each other via various communication protocols.To facilitat...

penalty clause or liquidated damage which is formerly agreed between parties is legally examined and accepted as a rule. although judge could in some circumstances modify this stipulation. yet its economic analysis which is focused on economic efficiency can be considered as a “major unexplained puzzle in the economic theory of law”. this article compares the major legal systems in the case of ...