In this paper, we propose ordered constraint hierarchies and a non-trivial error function to model and solve over-constrained real-world problems adequatly. We substantiate our proposition by an example. Then we present a new method to transform constraint hierarchies into equivalent ordinary constraint systems. For practial applications, we present a modiied algorithm based on an incomplete ni...

Use of modal procedures in systems with non-proportional damping (such as structures added viscous systems) results response errors, shown this study to depend on dissimilar and often conflicting conditions for different variables stories; thus, it is not possible propose simple rules based structural or properties limit the error a global way. However, four existing indices (originally propose...

We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qu...

This paper considers constrained minimization methods in a unified framework for the recovery of high-dimensional sparse signals in three settings: noiseless, bounded error, and Gaussian noise. Both minimization with an constraint (Dantzig selector) and minimization under an constraint are considered. The results of this paper improve the existing results in the literature by weakening the cond...

Methodologies to analyze error recovery properties of Variable Length Codes (VLCs) have been introduced in [1] and [2]. In this paper, we extend these methods to analyze the error-resilience of VLCs when soft decoding with length constraint strategies are applied at the decoder side. The approach allows in particular to compute the amount of information conveyed by the length constraint on a tr...

We examine the impact of adding a value-at-risk (VaR) constraint to the problem of an active manager who seeks to outperform a benchmark while minimizing tracking error variance (TEV) by using the model of Roll [1992. A mean/variance analysis of tracking error. Journal of Portfolio Management 18, 13–22]. We obtain three main results. First, portfolios on the constrained mean-TEV boundary still ...

We modify the off-line system identification procedure proposed by Regalia [4] into an adaptive IIR filtering algorithm based on the stochastic gradient method. The proposed algorithm aims to minimize equation error, recursively, under a unit-norm constraint on the characteristic polynomial instead of the usual monic constraint. The unit-norm constraint eliminates the bias associated with equat...

Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with high probability: (i), its probability of type I error is below a pre-specifi...

In the wireless communication, the error detection and correction techniques are widely used to achieve higher transmission efficiency. While transmitting the data, some coding techniques are deployed that provides the coding gain depending on its error correcting capability. Coding gain allows the wireless communication at lower transmit power level while maintaining low BER. Reed Solomon – Co...

We consider the problem of preemptively scheduling n imprecise computation tasks on m 1 uniform processors, with each task Ti having two weights wi and w ′ i . Three objectives are considered: (1) minimizing the maximum w′-weighted error; (2) minimizing the total w-weighted error subject to the constraint that the maximum w′-weighted error is minimized; (3) minimizing the maximum w′-weighted er...