Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same type of questions as those for the plane case...

Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.

We consider the problem of approximating a sequence of data points with a “nearly-isotonic”, or nearly-monotone function. This is formulated as a convex optimization problem that yields a family of solutions, with one extreme member being the standard isotonic regression fit. We devise a simple algorithm to solve for the path of solutions, which can be viewed as a modified version of the well-k...

Recently proposed adversarial classification methods have shown promising results for cost sensitive and multivariate losses. In contrast with empirical risk minimization (ERM) methods, which use convex surrogate losses to approximate the desired non-convex target loss function, adversarial methods minimize non-convex losses by treating the properties of the training data as being uncertain and...

Omnidirectional Robocup MSL robots often use catadioptric vision systems in order to enable 360o of field view. It comprises an upright camera facing a convex mirror, commonly spherical, parabolic or hyperbolic, that reflects the entire space around the robot. This technique is being used for more than a decade and in a similar way by most teams. Teams upgrade their cameras in order to obtain m...

—In this paper, an initial condition of strictly causal rational interpolative sigma-delta modulators (SDMs) is estimated based on quantizer output bit streams and an input signal. A set of initial conditions generating bounded trajectories is characterized. It is found that a set of initial conditions generating bounded trajectories but not necessarily corresponding to quantizer output bit str...