International audienceFixed-point iterations are commonly used to break the algebraic loops involved in the distributed optimization among computational entities sharing only a partial knowledge. However, although this approach is appealingly simple and that it works astonishingly well in many practical situations, its use is rarely associated to an appropriate analysis of its convergence. In this paper, it is shown that this iteration can be rationally conducted using control theory in order to derive a provable stability under appropriate assumption
AbstractIterative algorithms for fixed points of systems of equations are of importance in graph alg...
The paper discusses iterative methods for linear systems and various ways to accelerate their conver...
We introduce a new algorithm (horizontal algorithm) in a real Hilbert space, for approximating a com...
International audienceFixed-point iterations are commonly used to break the algebraic loops involved...
An iterative method to compute the minimum point in an unconstrained optimization problem can be vi...
In this paper a notion of control consistency (CC) for pairs of hierarchically ordered finite state ...
AbstractWe introduce the notion of a general fixed point iteration scheme to unify various fixed poi...
International audienceThis paper investigates the use of fixed-point Anderson method (AM) to a recen...
The concept of stability is studied on many different types of mathematical structures. This concept...
This thesis is a study of stability and numerical methods in optimization and control systems. Our f...
We propose synchronal algorithm and cyclic algorithm based on the general iterative method for solvi...
ABSTRACT. The article is devoted to the problem of control under uncertainty. The versions of Progra...
Iteration seems to play a fundamental role in learning theory - as everywhere else. Since neurons ne...
A hierarchical structure for on-line steady-state optimizing control of intercon-nected systems is d...
Abstract: Convergence study is given, defining the prerequisites for the implementation of the non-...
AbstractIterative algorithms for fixed points of systems of equations are of importance in graph alg...
The paper discusses iterative methods for linear systems and various ways to accelerate their conver...
We introduce a new algorithm (horizontal algorithm) in a real Hilbert space, for approximating a com...
International audienceFixed-point iterations are commonly used to break the algebraic loops involved...
An iterative method to compute the minimum point in an unconstrained optimization problem can be vi...
In this paper a notion of control consistency (CC) for pairs of hierarchically ordered finite state ...
AbstractWe introduce the notion of a general fixed point iteration scheme to unify various fixed poi...
International audienceThis paper investigates the use of fixed-point Anderson method (AM) to a recen...
The concept of stability is studied on many different types of mathematical structures. This concept...
This thesis is a study of stability and numerical methods in optimization and control systems. Our f...
We propose synchronal algorithm and cyclic algorithm based on the general iterative method for solvi...
ABSTRACT. The article is devoted to the problem of control under uncertainty. The versions of Progra...
Iteration seems to play a fundamental role in learning theory - as everywhere else. Since neurons ne...
A hierarchical structure for on-line steady-state optimizing control of intercon-nected systems is d...
Abstract: Convergence study is given, defining the prerequisites for the implementation of the non-...
AbstractIterative algorithms for fixed points of systems of equations are of importance in graph alg...
The paper discusses iterative methods for linear systems and various ways to accelerate their conver...
We introduce a new algorithm (horizontal algorithm) in a real Hilbert space, for approximating a com...