## Journals

- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- Electronic Research Announcements
- Conference Publications
- AIMS Mathematics

NACO

We provide lower estimates for the norm of gradients of Gaussian distribution functions and apply the results obtained
to a special class of probabilistically constrained optimization problems. In particular, it is shown how the precision of computing gradients in such problems can be controlled by the precision of function values for Gaussian distribution functions. Moreover, a sensitivity result for optimal values with respect to perturbations of the underlying random vector is derived. It is shown that the so-called maximal increasing slope of the optimal value with respect to the Kolmogorov distance between original and perturbed distribution can be estimated explicitly from the input data of the problem.

NACO

An optimal control problem to find the fastest collision-free trajectory of a robot surrounded by obstacles is presented.
The collision avoidance is based on linear programming arguments and expressed as state constraints. The optimal control problem is
solved with a sequential programming method. In order to decrease the number of unknowns and constraints a backface culling active set
strategy is added to the resolution technique.

keywords:
collision avoidance
,
cooperative robots
,
backface culling
,
active set strategy.
,
Optimal control

JIMO

Polyhedral discrepancies are relevant for the quantitative stability
of mixed-integer two-stage and chance constrained stochastic programs. We
study the problem of optimal scenario reduction for a discrete probability
distribution with respect to certain polyhedral discrepancies and develop
algorithms for determining the optimally reduced distribution approximately.
Encouraging numerical experience for optimal scenario reduction is provided.

keywords:
Kolmogorov
metric.
,
chance constraints
,
scenario reduction
,
discrepancy
,
two-stage
,
Stochastic programming
,
mixed-integer

## Year of publication

## Related Authors

## Related Keywords

[Back to Top]