#### Filter Results:

#### Publication Year

1990

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

T his paper proposes and tests variants of GRASP (greedy randomized adaptive search procedure) with path relinking for the three-index assignment problem (AP3). GRASP is a multistart metaheuristic for combinato-rial optimization. It usually consists of a construction procedure based on a greedy randomized algorithm and of a local search. Path relinking is… (More)

We present a modification of the DIRECT (DIviding RECTangles) algorithm, called DIRECT-G, to solve a box-constrained global optimization problem arising in the detection of gravitational waves emitted by coalescing binary systems of compact objects. This is a hard problem, since the objective function is highly nonlinear and expensive to evaluate, has a… (More)

- Roberta De Asmundis, Daniela Di, Serafino, Filippo Riccio, Gerardo Toraldo, R De Asmundis +3 others
- 2014

In recent years it has been made more and more clear that the critical issue in gradient methods is the choice of the step length, whereas using the gradient as search direction may lead to very effective algorithms , whose surprising behaviour has been only partially explained, mostly in terms of the spectrum of the Hessian matrix. On the other hand, the… (More)

We propose a new gradient method for quadratic programming, named SDC, which alternates some SD iterates with some gradient iterates that use a constant steplength computed through the Yuan formula. The SDC method exploits the asymptotic spectral behaviour of the Yuan steplength to foster a selective elimination of the components of the gradient along the… (More)