Search Results - "CASADO, L. G"

On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic by G.-Tóth, B., Casado, L. G., Hendrix, E. M. T., Messine, F.

“…Branch and Bound (B&B) algorithms in Global Optimization are used to perform an exhaustive search over the feasible area. One choice is to use simplicial…”
Get full text

Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU by Ortega, G., Filatovas, E., Garzón, E. M., Casado, L. G.

“…Evolutionary multi-objective optimization algorithms aim at finding an approximation of the Pareto set. For hard to solve problems with many conflicting…”
Get full text

On monotonicity and search strategies in face-based copositivity detection algorithms by G.-Tóth, B., Hendrix, E. M. T., Casado, L. G.

“…Over the last decades, algorithms have been developed for checking copositivity of a matrix. Methods are based on several principles, such as spatial branch…”
Get full text

On refinement of the unit simplex using regular simplices by G.-Tóth, B., Hendrix, E. M. T., Casado, L. G., García, I.

“…A natural way to define branching in branch and bound (B&B) for blending problems is bisection. The consequence of using bisection is that partition sets are…”
Get full text

New interval methods for constrained global optimization by MARKOT, M. Cs, FERNANDEZ, J, CASADO, L. G, CSENDES, T

“…Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we…”
Get full text

An SDN approach to detect targeted attacks in P2P fully connected overlays by Medina-López, Cristóbal, Casado, L. G., González-Ruiz, Vicente, Qiao, Yuansong

“…Pollution attacks are one of the major concerns facing P2P networks. They have a tremendous impact on push-based fully connected overlays, in which each peer…”
Get full text

New Interval Analysis Support Functions Using Gradient Information in a Global Minimization Algorithm by Casado, L G, MartÍnez, J A, GarcÍa, I, Ya.D. Sergeyev

“…The performance of interval analysis branch-and-bound global optimization algorithms strongly depends on the efficiency of selection, bounding, elimination,…”
Get full text

Heuristic rejection in interval global optimization by CASADO, L. G, GARCIA, I, CSENDES, T, RUIZ, V. G

“…Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a…”
Get full text

Generating a smallest binary tree by proper selection of the longest edges to bisect in a unit simplex refinement by Salmerón, J. M. G., Aparicio, G., Casado, L. G., García, I., Hendrix, E. M. T., G.-Tóth, B.

“…In several areas like global optimization using branch-and-bound methods for mixture design, the unit n -simplex is refined by longest edge bisection (LEB)…”
Get full text

Adaptive parallel interval branch and bound algorithms based on their performance for multicore architectures by Sanjuan-Estrada, J. F., Casado, L. G., García, I.

“…This work studies how to adapt the number of threads of a parallel Interval Branch and Bound algorithm to the available computational resources based on its…”
Get full text

Experiments with a new selection criterion in a fast interval optimization algorithm by Casado, L G, Martínez, J A, García, I

“…Usually, interval global optimization algorithms use local search methods to obtain a good upper (lower) bound of the solution. These local methods are based…”
Get full text

On determining the cover of a simplex by spheres centered at its vertices by Casado, L. G., García, I., Tóth, B. G., Hendrix, E. M. T.

“…The aim of this work is to study the Simplex Cover (SC) problem, which is to determine whether a given simplex is covered by spheres centered at its vertices…”
Get full text

On estimating workload in interval branch-and-bound global optimization algorithms by Berenguel, José L., Casado, L. G., García, I., Hendrix, Eligius M. T.

“…In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up…”
Get full text

On interval branch-and-bound for additively separable functions with common variables by Berenguel, J. L., Casado, L. G., García, I., Hendrix, E. M. T., Messine, F.

“…Interval branch-and-bound (B&B) algorithms are powerful methods which look for guaranteed solutions of global optimisation problems. The computational effort…”
Get full text

Asynchronous privacy-preserving iterative computation on peer-to-peer networks by Naranjo, J. A. M., Casado, L. G., Jelasity, Márk

“…Privacy preserving algorithms allow several participants to compute a global function collaboratively without revealing local information to each other…”
Get full text

A new multisection technique in interval methods for global optimization by CASADO, L. G, GARCIA, I, CSENDES, T

Get full text

Fully distributed authentication with locality exploitation for the CoDiP2P peer-to-peer computing platform by Naranjo, J. A. M., Cores, F., Casado, L. G., Guirado, F.

“…CodiP2P is a distributed platform for computation based on the peer-to-peer paradigm. This article presents a novel distributed authentication method that…”
Get full text

Local search versus linear programming to detect monotonicity in simplicial branch and bound by Casado, L. G., G.-Tóth, B., Hendrix, E. M. T., Messine, F.

“…This study focuses on exhaustive global optimization algorithms over a simplicial feasible set with simplicial partition sets. Bounds on the objective function…”
Get full text

On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms by Martínez, J.A., Casado, L.G., García, I., Sergeyev, Ya.D., Tóth, B.

“…This paper analyzes and evaluates an efficient n-dimensional global optimization algorithm. It is a natural n-dimensional extension of the algorithm of Casado…”
Get full text

A suite of algorithms for key distribution and authentication in centralized secure multicast environments by Naranjo, J.A.M., Antequera, N., Casado, L.G., López-Ramos, J.A.

“…The Extended Euclidean algorithm provides a fast solution to the problem of finding the greatest common divisor of two numbers. In this paper, we present three…”
Get full text