Search results for " optimization"

Multilevel preconditioning and adaptive sparse solution of inverse problems

2012

Continuous reformulations and heuristics for the Euclidean travelling salesperson problem

2008

We consider continuous reformulations of the Euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the Euclidean TSP.

Global convergence and rate of convergence of a method of centers

1994

We consider a method of centers for solving constrained optimization problems. We establish its global convergence and that it converges with a linear rate when the starting point of the algorithm is feasible as well as when the starting point is infeasible. We demonstrate the effect of the scaling on the rate of convergence. We extend afterwards, the stability result of [5] to the infeasible case anf finally, we give an application to semi-infinite optimization problems.

Uniqueness of solutions for some elliptic equations with a quadratic gradient term

2008

We study a comparison principle and uniqueness of positive solutions for the homogeneous Dirichlet boundary value problem associated to quasi-linear elliptic equations with lower order terms. A model example is given by −Δu + λ |∇u| 2 u r = f (x) ,λ , r >0. The main feature of these equations consists in having a quadratic gradient term in which singularities are allowed. The arguments employed here also work to deal with equations having lack of ellipticity or some dependence on u in the right hand side. Furthermore, they could be applied to obtain uniqueness results for nonlinear equations having the p-Laplacian operator as the principal part. Our results improve those already known, even…

A Posteriori Error Bounds for Approximations of the Oseen Problem and Applications to the Uzawa Iteration Algorithm

2014

Abstract. We derive computable bounds of deviations from the exact solution of the stationary Oseen problem. They are applied to approximations generated by the Uzawa iteration method. Also, we derive an advanced form of the estimate, which takes into account approximation errors arising due to discretization of the boundary value problem, generated by the main step of the Uzawa method. Numerical tests confirm our theoretical results and show practical applicability of the estimates.

Méthodes géométriques et analytiques pour étudier l'application exponentielle, la sphère et le front d'onde en géométrie sous-riemannienne dans le ca…

1999

Consider a sub-riemannian geometry (U,D,g) where U is a neighborhood of 0 in R 3 , D is a Martinet type distribution identified to ker ω , ω being the 1-form: , q=(x,y,z) and g is a metric on D which can be taken in the normal form : , a=1+yF(q) , c=1+G(q) , . In a previous article we analyze the flat case : a=c=1 ; we describe the conjugate and cut loci , the sphere and the wave front . The objectif of this article is to provide a geometric and computational framework to analyze the general case. This frame is obtained by analysing three one parameter deformations of the flat case which clarify the role of the three parameters in the gradated normal form of order 0 where: , . More generall…

Network structure and optimal technological innovation

2019

The role of networks in the emergence, diffusion and evolution of technological innovations has attracted much theoretical and empirical attention. Yet, much of the work has explored the role of undirected and homogeneous networks. In real cases, many networks are directed. The flow of information, benefits or observations is directed from one node towards another node. Real networks are also heterogeneous, for example, few nodes have a high degree while many others have a low degree. In this article, we report on the results of an evolutionary agent-based model in which a group of agents, in our case firms, collectively search a complex (rugged) technological landscape and observe each oth…

Numerical methods in the design process of a sailing yacht

2014

Learning Automata-based Misinformation Mitigation via Hawkes Processes

2021

AbstractMitigating misinformation on social media is an unresolved challenge, particularly because of the complexity of information dissemination. To this end, Multivariate Hawkes Processes (MHP) have become a fundamental tool because they model social network dynamics, which facilitates execution and evaluation of mitigation policies. In this paper, we propose a novel light-weight intervention-based misinformation mitigation framework using decentralized Learning Automata (LA) to control the MHP. Each automaton is associated with a single user and learns to what degree that user should be involved in the mitigation strategy by interacting with a corresponding MHP, and performing a joint ra…

Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms

2010

Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…