Search results for "Applied Mathematics"
showing 10 items of 4379 documents
Strict quasi-concavity and the differential barrier property of gauges in linear programming
2014
Concave gauge functions were introduced to give an analytical representation of cones. In particular, they give a simple and a practical representation of the positive orthant. There is a wide choice of concave gauge functions with interesting properties, representing the same cone. Besides the fact that a concave gauge cannot be identically zero on a cone(), it may be continuous, differentiable and even on its interior. The purpose of the present paper is to present another approach to penalizing the positivity constraints of a linear programme using an arbitrary strictly quasi-concave gauge representation. Throughout the paper, we generalize the concept of the central path and the analyti…
Resonance of minimizers forn-level quantum systems with an arbitrary cost
2004
We consider an optimal control problem describing a laser-induced population transfer on a n-level quantum system. For a convex cost depending only on the moduli of controls ( i.e. the lasers intensities), we prove that there always exists a minimizer in resonance. This permits to justify some strategies used in experimental physics. It is also quite important because it permits to reduce remarkably the complexity of the problem (and extend some of our previous results for n=2 and n=3): instead of looking for minimizers on the sphere one is reduced to look just for minimizers on the sphere . Moreover, for the reduced problem, we investigate on the question of existence of strict abnormal mi…
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…
Sustainable Management of Tourist Flow Networks: A Mean Field Model
2023
In this article, we propose a mean field game approach for modeling the flows of excursionists within a network of tourist attractions. We prove the existence of an equilibrium within the network using a balance ordinary differential equation together with optimality conditions in terms of the value function. We also propose a bi-level formulation of the problem where we aim at achieving a sustainable-oriented control strategy in the upper level and at maximizing excursionists’ satisfaction in the lower level. Our proposed model may provide an effective management tool for local authorities who deal with the challenging problem of finding an optimal control policy to the often conflicting o…
Guidance Trajectories for Spacecraft Rendezvous
2007
In a previous paper of Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employed the single-subarc sequential gradient-restoration algorithm to optimize the three-dimensional rendezvous between a target spacecraft in a planar circular orbit and a chaser spacecraft with an initial separation distance and separation velocity. The achieved continuous solutions are characterized by two, three, or four subarcs depending on the performance index (time, fuel) and the constraints. In this paper, based on the solutions in Miele et al. (J. Optim. Theory Appl. 132(1), 2007), we employ the multiple-subarc sequential gradient-restoration algorithm to produce pieced guidance trajectories implementa…
Optimal Trajectories for Spacecraft Rendezvous
2007
The efficient execution of a rendezvous maneuver is an essential component of various types of space missions. This work describes the formulation and numerical investigation of the thrust function required to minimize the time or fuel required for the terminal phase of the rendezvous of two spacecraft. The particular rendezvous studied concerns a target spacecraft in a circular orbit and a chaser spacecraft with an initial separation distance and separation velocity in all three dimensions. First, the time-optimal rendezvous is investigated followed by the fuel-optimal rendezvous for three values of the max-thrust acceleration via the sequential gradient-restoration algorithm. Then, the ti…
Convergence of Markovian Stochastic Approximation with discontinuous dynamics
2016
This paper is devoted to the convergence analysis of stochastic approximation algorithms of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H_{\theta_n}({X_{n+1}})$, where ${\left\{ {\theta}_n, n \in {\mathbb{N}} \right\}}$ is an ${\mathbb{R}}^d$-valued sequence, ${\left\{ {\gamma}_n, n \in {\mathbb{N}} \right\}}$ is a deterministic stepsize sequence, and ${\left\{ {X}_n, n \in {\mathbb{N}} \right\}}$ is a controlled Markov chain. We study the convergence under weak assumptions on smoothness-in-$\theta$ of the function $\theta \mapsto H_{\theta}({x})$. It is usually assumed that this function is continuous for any $x$; in this work, we relax this condition. Our results are illustrated by c…
Probabilistic interpretation of the Calderón problem
2017
In this paper, we use the theory of symmetric Dirichlet forms to give a probabilistic interpretation of Calderon's inverse conductivity problem in terms of reflecting diffusion processes and their corresponding boundary trace processes. This probabilistic interpretation comes in three equivalent formulations which open up novel perspectives on the classical question of unique determinability of conductivities from boundary data. We aim to make this work accessible to both readers with a background in stochastic process theory as well as researchers working on deterministic methods in inverse problems.
Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations
2022
AbstractWe introduce novel concepts to solve multiobjective optimization problems involving (computationally) expensive function evaluations and propose a new interactive method called O-NAUTILUS. It combines ideas of trade-off free search and navigation (where a decision maker sees changes in objective function values in real time) and extends the NAUTILUS Navigator method to surrogate-assisted optimization. Importantly, it utilizes uncertainty quantification from surrogate models like Kriging or properties like Lipschitz continuity to approximate a so-called optimistic Pareto optimal set. This enables the decision maker to search in unexplored parts of the Pareto optimal set and requires …
An Adaptive Alternating Direction Method of Multipliers
2021
AbstractThe alternating direction method of multipliers (ADMM) is a powerful splitting algorithm for linearly constrained convex optimization problems. In view of its popularity and applicability, a growing attention is drawn toward the ADMM in nonconvex settings. Recent studies of minimization problems for nonconvex functions include various combinations of assumptions on the objective function including, in particular, a Lipschitz gradient assumption. We consider the case where the objective is the sum of a strongly convex function and a weakly convex function. To this end, we present and study an adaptive version of the ADMM which incorporates generalized notions of convexity and penalty…