Displaying similar documents to “Recursive form of general limited memory variable metric methods”

A new regular multiplier embedding

Gemayqzel Bouza Allende, Jürgen Guddat (2013)

Kybernetika

Similarity:

Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions...

Weak regularizability and pole assignment for non-square linear systems

Tetiana Korotka, Jean-Jacques Loiseau, Petr Zagalak (2012)

Kybernetika

Similarity:

The problem of pole assignment by state feedback in the class of non-square linear systems is considered in the paper. It is shown that the problem is solvable under the assumption of weak regularizability, a newly introduced concept that can be viewed as a generalization of the regularizability of square systems. Necessary conditions of solvability for the problem of pole assignment are established. It is also shown that sufficient conditions can be derived in some special cases. Some...

On tropical Kleene star matrices and alcoved polytopes

María Jesús de la Puente (2013)

Kybernetika

Similarity:

In this paper we give a short, elementary proof of a known result in tropical mathematics, by which the convexity of the column span of a zero-diagonal real matrix A is characterized by A being a Kleene star. We give applications to alcoved polytopes, using normal idempotent matrices (which form a subclass of Kleene stars). For a normal matrix we define a norm and show that this is the radius of a hyperplane section of its tropical span.

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge, Minghao Chen, Hiroaki Ishii (2012)

Kybernetika

Similarity:

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination...