Displaying similar documents to “Hierarchical control via augmented Lagrangians”

Analysis of an isopetype dual algorithm for optimizing control and nonlinear optimization

Wojciech Tadej, Piotr Tatjewski (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

First results concerning important theoretical properties of the dual ISOPE (Integrated System Optimization and Parameter Estimation) algorithm are presented. The algorithm applies to on-line set-point optimization in control structures with uncertainty in process models and disturbance estimates, as well as to difficult nonlinear constrained optimization problems. Properties of the conditioned (dualized) set of problem constraints are investigated, showing its structure and feasibility...

An analysis of selection sort using recurrence relations.

Francesc J. Ferri, Jesús Albert (1996)

Qüestiió

Similarity:

This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case...

A modification of the two-level algorithm with overcorrection

Stanislav Míka, Petr Vaněk (1992)

Applications of Mathematics

Similarity:

In this paper we analyse an algorithm which is a modification of the so-called two-level algorithm with overcorrection, published in [2]. We illustrate the efficiency of this algorithm by a model example.

Adaptive search heuristics for the generalized assignment problem.

Helena Ramalhinho Lourenço, Daniel Serra (2002)

Mathware and Soft Computing

Similarity:

The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the agent's resource. We present the application of a MAX-MIN Ant System (MMAS) and a greedy randomized adaptive search procedure (GRASP) to the generalized assignment problem based on hybrid approaches. The MMAS heuristic can be seen as an...