We develop a method for computing facet-defining valid inequalities for any mixed-integer set PJ . While our practical implementation does not return only facet-defining inequal...
In this work, we present an exact approach for solving network design problems that is based on an iterative graph aggregation procedure. The scheme allows existing preinstalled c...
Quadratic programming problems (QPs) that arise from dynamic optimization problems typically exhibit a very particular structure. We address the ubiquitous case where these QPs are...
Abstract We address the solution of a very challenging (and previously unsolved) instance of the quadratic 3-dimensional assignment problem, arising in digital wireless communicati...
: Quadratic models Qk(x), x ∈ Rn , of the objective function F(x), x∈Rn , are used by many successful iterative algorithms for minimization, where k is the iteration number. Gi...
Recently, the alternating direction method of multipliers (ADMM) has received intensive attention from a broad spectrum of areas. The generalized ADMM (GADMM) proposed by Eckstein ...
Ethan X. Fang, Bingsheng He, Han Liu, Xiaoming Yua...
We present a line search algorithm for minimizing nonconvex and/or nonsmooth objective functions. The algorithm is a hybrid between a standard Broyden-Fletcher-Goldfarb-Shanno (BFG...
Generic programming (GP) is a form of abstraction in programming languages that serves to reduce code duplication by exploiting the regular structure of algebraic datatypes. Severa...
We show that every regular language, via some DFA which accepts it, gives rise to a homomorphism from the semiring of polynomial functors to the semiring of n×n matrices over poly...