Search results for " optimization."

On complexity and motion planning for co-rank one sub-Riemannian metrics

2004

In this paper, we study the motion planning problem for generic sub-Riemannian metrics of co-rank one. We give explicit expressions for the metric complexity (in the sense of Jean (10,11)), in terms of the elementary invariants of the problem. We construct asymptotic optimal syntheses. It turns out that among the results we show, the most complicated case is the 3-dimensional. Besides the generic C ∞ case, we study some non-generic generalizations in the analytic case.

Orientation matters

2008

The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…

Table of periodic properties of human immunodeficiency virus inhibitors

2010

Classification algorithms are proposed based on information entropy. The feasibility of mixing a given human immunodeficiency virus (HIV) inhibitor with dissimilar ones is studied. The 31 inhibitors are classified by their structural chemical properties. Many classification algorithms are based on information entropy. An excessive number of results appear compatible with the data and suffer combinatorial explosion. However, after the equipartition conjecture one has a selection criterion. According to this conjecture, the best configuration is that in which entropy production is most uniformly distributed. The structural elements of an inhibitor can be ranked according to their inhibitory a…

Special issue on geometric constraints and reasoning

2012

Special issue on the occasion of the International Workshop on Complex Networks and their Applications

2014

On a topology optimization problem governed by two-dimensional Helmholtz equation

2015

The paper deals with a class of shape/topology optimization problems governed by the Helmholtz equation in 2D. To guarantee the existence of minimizers, the relaxation is necessary. Two numerical methods for solving such problems are proposed and theoretically justified: a direct discretization of the relaxed formulation and a level set parametrization of shapes by means of radial basis functions. Numerical experiments are given.

Projective Reeds-Shepp car onS2with quadratic cost

2008

Fix two points x, ¯ ∈ S 2 and two directions (without orientation) η,¯ η of the velocities in these points. In this paper we are interested to the problem of minimizing the cost

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.