When considering Electre s valued outranking relations, aggregation/disaggregation methodologies have difficulties in taking discordance (veto) into account. We present a partial inference procedure to compute the value of the vetorelated parameters that best restore a set of outranking statements (i.e., examples that an Electre model should restore) provided by a decision maker, given fixed va...

We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input or output sides. We consider two widely adopted types of such penalties as our motivating examples: 1) overlapping-group-lasso penalty, based on `1/`2 mixed-norm, and 2) graph-guided fusion penalty. For both types of ...

We develop a network revenue management model to jointly make capacity control and overbooking decisions. Our approach is based on the observation that if the penalty cost of denying boarding to the reservations at the departure time were given by a separable function, then the dynamic programming formulation of the network revenue management problem would decompose by the itineraries and it co...

Symbolic regression that aims to detect underlying data-driven model, has become increasingly important for industrial data analysis when the experimental model structure is unknown or wrong, or the concerned system has changed. For most of the existing algorithms for symbolic regression, such as genetic programming, the convergence speed might be too slow for large scale problems with a large ...

let c be a field of subsets of a set i. also, let     1 i i be a non-decreasing positivesequence of real numbers such that 1, 1 0 1   i  and    11 i i . in this paper we prove thatbv of all the games of -bounded variation on c is a non-separable and norm dual banach space of thespace of simple games on c . we use this fact to establish the existence of a linear mapping t from...

In this paper, by combining the splitting method of augmented Lagrange function (ALF) with sequential quadratic programming (SQP) approximation, a novel ALF-based algorithm SQP structure is proposed for multi-block linear constrained nonconvex separable optimization. The new uses idea to decompose original problem into several small-scale subproblems. Meanwhile, approximation and Armijo-type li...