Displaying similar documents to “A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)”

Inequality-sum : a global constraint capturing the objective function

Jean-Charles Régin, Michel Rueher (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = Σ x i , and where the integer variables x i are subject to difference constraints of the form x j - x i c . An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. This new constraint is also more general than a sum constraint defined on a set of ordered variables. Classical...

A Distance-Based Method for Attribute Reduction in Incomplete Decision Systems

Demetrovics, Janos, Thi, Vu Duc, Giang, Nguyen Long (2013)

Serdica Journal of Computing

Similarity:

There are limitations in recent research undertaken on attribute reduction in incomplete decision systems. In this paper, we propose a distance-based method for attribute reduction in an incomplete decision system. In addition, we prove theoretically that our method is more effective than some other methods.

Interval algorithm for absolute value equations

Aixiang Wang, Haijun Wang, Yongkun Deng (2011)

Open Mathematics

Similarity:

We investigate the absolute value equations Ax−|x| = b. Based on ɛ-inflation, an interval verification method is proposed. Theoretic analysis and numerical results show that the new proposed method is effective.