Related papers: On the chaotic behavior of the Primal--Dual Affine…
This work proposes a new edge about the Chaotic Genetic Algorithm (CGA) and the importance of the entropy in the initial population. Inspired by chaos theory the CGA uses chaotic maps to modify the stochastic parameters of Genetic Algorithm…
We describe and analyze an interior-point method to decide feasibility problems of second-order conic systems. A main feature of our algorithm is that arithmetic operations are performed with finite precision. Bounds for both the number of…
The primal-dual interior point method (IPM) is widely regarded as the most efficient IPM variant for linear optimization. In this paper, we demonstrate that the improved stability of the pure primal IPM can allow speedups relative to a…
We consider primal-dual pairs of semidefinite programs and assume that they are ill-posed, i.e., both primal and dual are either weakly feasible or weakly infeasible. Under such circumstances, strong duality may break down and the primal…
The pattern dynamics of the one-way coupled logistic lattice which can serve as a phenomenological model for open flow is investigated and shown to be extremely rich. For medium and large coupling strengths, we find spatially periodic,…
We discuss how to characterize the behavior of a chaotic dynamical system depending on a parameter that varies periodically in time. In particular, we study the predictability time, the correlations and the mean responses, by defining a…
We propose a discrete time dynamical system (a map) as phenomenological model of excitable and spiking-bursting neurons. The model is a discontinuous two-dimensional map. We find condition under which this map has an invariant region on the…
The efficient detection of chaotic behavior in orbits of a complex dynamical system is an active domain of research. Several indicators have been proposed in the past, and new ones have recently been developed in view of improving the…
Chaotic behavior arises from very simple non-linear dynamical equation of logistic map which makes it was used often in designing chaotic image encryption schemes. However, some properties of chaotic maps can also facilitate cryptanalysis…
Linear control theory is used to develop an improved localized control scheme for spatially extended chaotic systems, which is applied to a Coupled Map Lattice as an example. The optimal arrangement of the control sites is shown to depend…
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…
We consider here a recently proposed geometrical criterion for local instability based on the geodesic deviation equation. Although such a criterion can be useful in some cases, we show here that, in general, it is neither necessary nor…
A network of $N$ elements is studied in terms of a deterministic globally coupled map which can be chaotic. There exists a range of values for the parameters of the map where the number of different macroscopic configurations is very large,…
In this paper, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers,…
Dynamics of coupled chaotic oscillators on a network are studied using coupled maps. Within a broad range of parameter values representing the coupling strength or the degree of elements, the system repeats formation and split of coherent…
In this work, we consider two-stage quadratic optimization problems under ellipsoidal uncertainty. In the first stage, one needs to decide upon the values of a subset of optimization variables (control variables). In the second stage, the…
We study a deterministic dynamics with two time scales in a continuous state attractor network. To the usual (fast) relaxation dynamics towards point attractors (``patterns'') we add a slow coupling dynamics that makes the visited patterns…
Many realistic decision-making problems in networked scenarios, such as formation control and collaborative task offloading, often involve complicatedly entangled local decisions, which, however, have not been sufficiently investigated yet.…
We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…
The gradient mapping norm is a strong and easily verifiable stopping criterion for first-order methods on composite problems. When the objective exhibits the quadratic growth property, the gradient mapping norm minimization problem can be…