Several recent publications investigated Markov-chain modelling of linear optimization by a (1,lambda)-ES, considering both unconstrained and linearly constrained optimization, and both constant and varying step size. All of them assume normality of the involved random steps. This is a very strong and specific assumption. The objective of our contribution is to show that in the constant step size case, valuable properties of the Markov chain can be obtained even for steps with substantially more general distributions. Several results that have been previously proved using the normality assumption are proved here in a more general way without that assumption. Finally, the decomposition of a multidimensional distribution into its marginals an...
International audienceThis paper considers the optimal scaling problem for high-dimensional random w...
The theory of general state-space Markov chains can be strongly related to the case of discrete stat...
AbstractExterior-point linear programming algorithms have been modelled as a Markov chain in order t...
Several recent publications investigated Markov-chain modelling of linear optimization by a $(1,\lam...
International audienceSeveral recent publications investigated Markov-chain mod-elling of linear opt...
International audienceThis paper analyses a $(1,\lambda)$-Evolution Strategy, a randomised compariso...
We consider dependence coefficients for stationary Markov chains. We emphasize on some equ...
International audienceThis paper analyzes a (1, λ)-Evolution Strategy, a randomized comparison-based...
In this paper we are concentrated on a problem of linear chanceconstrained programming where the co...
This paper considers efficient estimation of copula-based semiparametric strictly stationary Markov ...
Abstract. We study the generation of uniformly distributed linear extensions using Markov chains. In...
Many complex proesses can be modeled by (countably) infinite, multidimensional Markov chains. Unfort...
In this dissertation an analysis of Evolution Strategies (ESs) using the theory of Markov chains is ...
Archimedean copulas form a prominent class of copulas which lead to the construction of multivariate...
AbstractDependence coefficients have been widely studied for Markov processes defined by a set of tr...
International audienceThis paper considers the optimal scaling problem for high-dimensional random w...
The theory of general state-space Markov chains can be strongly related to the case of discrete stat...
AbstractExterior-point linear programming algorithms have been modelled as a Markov chain in order t...
Several recent publications investigated Markov-chain modelling of linear optimization by a $(1,\lam...
International audienceSeveral recent publications investigated Markov-chain mod-elling of linear opt...
International audienceThis paper analyses a $(1,\lambda)$-Evolution Strategy, a randomised compariso...
We consider dependence coefficients for stationary Markov chains. We emphasize on some equ...
International audienceThis paper analyzes a (1, λ)-Evolution Strategy, a randomized comparison-based...
In this paper we are concentrated on a problem of linear chanceconstrained programming where the co...
This paper considers efficient estimation of copula-based semiparametric strictly stationary Markov ...
Abstract. We study the generation of uniformly distributed linear extensions using Markov chains. In...
Many complex proesses can be modeled by (countably) infinite, multidimensional Markov chains. Unfort...
In this dissertation an analysis of Evolution Strategies (ESs) using the theory of Markov chains is ...
Archimedean copulas form a prominent class of copulas which lead to the construction of multivariate...
AbstractDependence coefficients have been widely studied for Markov processes defined by a set of tr...
International audienceThis paper considers the optimal scaling problem for high-dimensional random w...
The theory of general state-space Markov chains can be strongly related to the case of discrete stat...
AbstractExterior-point linear programming algorithms have been modelled as a Markov chain in order t...