The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Averaging approach to distributed convex optimization for continuous-time multi-agent systems”

Distributed event-triggered algorithm for optimal resource allocation of multi-agent systems

Weiyong Yu, Zhenhua Deng, Hongbing Zhou, Xianlin Zeng (2017)

Kybernetika

Similarity:

This paper is concerned with solving the distributed resource allocation optimization problem by multi-agent systems over undirected graphs. The optimization objective function is a sum of local cost functions associated to individual agents, and the optimization variable satisfies a global network resource constraint. The local cost function and the network resource are the private data for each agent, which are not shared with others. A novel gradient-based continuous-time algorithm...

High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems

Roman Dębski (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

Effective, simulation-based trajectory optimization algorithms adapted to heterogeneous computers are studied with reference to the problem taken from alpine ski racing (the presented solution is probably the most general one published so far). The key idea behind these algorithms is to use a grid-based discretization scheme to transform the continuous optimization problem into a search problem over a specially constructed finite graph, and then to apply dynamic programming to find an...

Editorial

Clarisse Dhaenens, Patrick Siarry, El-Ghazali Talbi (2008)

RAIRO - Operations Research

Similarity:

Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs

Mario C. Lopez-Loces, Jedrzej Musial, Johnatan E. Pecero, Hector J. Fraire-Huacuja, Jacek Blazewicz, Pascal Bouvry (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve...

Solving convex program via Lagrangian decomposition

Matthias Knobloch (2004)

Kybernetika

Similarity:

We consider general convex large-scale optimization problems in finite dimensions. Under usual assumptions concerning the structure of the constraint functions, the considered problems are suitable for decomposition approaches. Lagrangian-dual problems are formulated and solved by applying a well-known cutting-plane method of level-type. The proposed method is capable to handle infinite function values. Therefore it is no longer necessary to demand the feasible set with respect to the...

A novel generalized oppositional biogeography-based optimization algorithm: application to peak to average power ratio reduction in OFDM systems

Sotirios K. Goudos (2016)

Open Mathematics

Similarity:

A major drawback of orthogonal frequency division multiplexing (OFDM) signals is the high value of peak to average power ratio (PAPR). Partial transmit sequences (PTS) is a popular PAPR reduction method with good PAPR reduction performance, but its search complexity is high. In this paper, in order to reduce PTS search complexity we propose a new technique based on biogeography-based optimization (BBO). More specifically, we present a new Generalized Oppositional Biogeography Based Optimization...

Meta-optimization of bio-inspired algorithms for antenna array design

Virgilio Zúñiga-Grajeda, Alberto Coronado-Mendoza, Kelly Joel Gurubel-Tun (2018)

Kybernetika

Similarity:

In this article, a technique called Meta-Optimization is used to enhance the effectiveness of bio-inspired algorithms that solve antenna array synthesis problems. This technique consists on a second optimization layer that finds the best behavioral parameters for a given algorithm, which allows to achieve better results. Bio-inspired computational methods are useful to solve complex multidimensional problems such as the design of antenna arrays. However, their performance depends heavily...