Extrapolation and Local Acceleration of an Iterative Process for Common Fixed Point Problems

We consider sequential iterative processes for the common fixed point problem of families of cutter operators on a Hilbert space. These are operators that have the property that, for any point x∈H, the hyperplane through Tx whose normal is x-Tx always “cuts” the space into two half-spaces one of which contains the point x while … Read more

ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING

In this paper, we consider the solution of the standard linear programming (LP). A remarkable result in LP claims that all optimal solutions form an optimal face of the underlying polyhedron. In practice, many real-world problems have infinitely many optimal solutions and pursuing the optimal face, not just an optimal vertex, is quite desirable. The … Read more

On the Convergence Properties of Non-Euclidean Extragradient Methods for Variational Inequalities with Generalized Monotone Operators

In this paper, we study a class of generalized monotone variational inequality (GMVI) problems whose operators are not necessarily monotone (e.g., pseudo-monotone). We present non-Euclidean extragradient (N-EG) methods for computing an approximate strong solution of these problems, and demonstrate how their iteration complexities depend on the global Lipschitz or H\”{o}lder continuity properties for their operators … Read more

Parallel distributed-memory simplex for large-scale stochastic LP problems

We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These problems have been considered too large to solve with the simplex method; instead, decomposition approaches based on Benders decomposition or, more recently, interior-point methods are generally used. However, these approaches do not provide optimal … Read more

Moneyless strategy-proof mechanism on single-sinked policy domain: characterization and applications

We completely characterize deterministic strategy-proof and group strategy-proof mechanisms on single-sinked public policy domain. The single-sinked domain can be used to model any allocation problem where a single output must be chosen in an interval with the assumption that agents’ preferences have a single most loathful point (the sink) in the interval, and the preferences … Read more

pcaL1: An Implementation in R of Three Methods for L1-Norm Principal Component Analysis

pcaL1 is a package for the R environment for finding principal components using methods based on the L1 norm. The principal components derived using traditional principal component analysis (PCA) can be interpreted as an optimal solution to several optimization problems involving the L2 norm. Using the L1 norm in these problems provides an alternative that … Read more

The Split Common Null Point Problem

We introduce and study the Split Common Null Point Problem (SCNPP) for set-valued maximal monotone mappings in Hilbert spaces. This problem generalizes our Split Variational Inequality Problem (SVIP) [Y. Censor, A. Gibali and S. Reich, Algorithms for the split variational inequality problem, Numerical Algorithms 59 (2012), 301–323]. The SCNPP with only two set-valued mappings entails … Read more

Solving Bin Packing Related Problems Using an Arc Flow Formulation

We present a new method for solving bin packing problems, including two-constraint variants, based on an arc flow formulation with side constraints. Conventional formulations for bin packing problems are usually highly symmetric and provide very weak lower bounds. The arc flow formulation proposed provides a very strong lower bound, and is able to break symmetry … Read more

Single-Row Equidistant Facility Layout as a Special Case of Single-Row Facility Layout

In this paper we discuss two particular layout problems, namely the Single-Row Equidistant Facility Layout Problem (SREFLP) and the Single-Row Facility Layout Problem (SRFLP). Our aim is to consolidate the two respective branches in the layout literature. We show that the SREFLP is not only a special case of the Quadratic Assignment Problem but also … Read more

Hybridizing VNS and path-relinking on a particle swarm framework to minimize total flowtime

This paper presents a new hybridization of VNS and path-relinking on a particle swarm framework for the permutational fowshop scheduling problem with total flowtime criterion. The operators of the proposed particle swarm are based on path-relinking and variable neighborhood search methods. The performance of the new approach was tested on the bechmark suit of Taillard, … Read more