Related papers: Control of the non-geometrically integral reductio…
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
We obtain a quantitative version of the classical Chevalley-Weil theorem for curves. Let $\phi : \tilde{C} \to C$ be an unramified morphism of non-singular plane projective curves defined over a number field $K$. We calculate an effective…
We would like to study the solution stability of a parametric control problem governed by semilinear elliptic equations with a mixed state-control constraint, where the cost function is nonconvex and the admissible set is unbounded. The…
This paper explores the role of symmetries and reduction in nonlinear control and optimal control systems. The focus of the paper is to give a geometric framework of symmetry reduction of optimal control systems as well as to show how to…
Dimensionality reduction is a fundamental task in modern data science. Several projection methods specifically tailored to take into account the non-linearity of the data via local embeddings have been proposed. Such methods are often based…
Projection operators are important in Analysis, Optimization and Algorithm. It is well known that these operators are firmly nonexpansive. In this paper, we provide an exact result that sharpens this well-known result. We develop the theory…
In this article a new upper bounds for the multiple trigonometrical integrals are found. The method of the work based on a new method of estimation for the areas of algebraic surfaces.
This paper considers the stochastic linear quadratic optimal control problem in which the control domain is nonconvex. By the functional analysis and convex perturbation methods, we establish a novel maximum principle. The application of…
Linear projection schemes like Proper Orthogonal Decomposition can efficiently reduce the dimensions of dynamical systems but are naturally limited, e.g., for convection-dominated problems. Nonlinear approaches have shown to outperform…
In this paper, we describe a constrained Lagrangian and Hamiltonian formalism for the optimal control of nonholonomic mechanical systems. In particular, we aim to minimize a cost functional, given initial and final conditions where the…
In this paper, we focus on the control of the mean field equilibrium of non linear networks of the Langevin type in the limit of small noise. Using iterative linear approximations, we derive a formula that prescribes a control strategy in…
In this paper, we prove the degree upper bound of projective subschemes in terms of the reduction number and show that the maximal cases are only arithmetically Cohen-Macaulay subschemes with linear resolution. Furthermore, it can be shown…
In this paper we investigate infinite horizon optimal control problems for parametrized partial differential equations. We are interested in feedback control via dynamic programming equations which is well-known to suffer from the curse of…
The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among…
In this paper, we propose a novel primal-dual inexact gradient projection method for nonlinear optimization problems with convex-set constraint. This method only needs inexact computation of the projections onto the convex set for each…
We give an upper bound on the number of rational points of an arbitrary Zariski closed subset of a projective space over a finite field. This bound depends only on the dimensions and degrees of the irreducible components and holds for very…
Proposed is a program for what we call Geometric Arithmetic, based on our works on non-abelian zeta functions and non-abelian class field theory. Key words are stability and adelic intersection-cohomology theory.
In a normed space setting, this paper studies the conditions under which the projected solutions to a quasi equilibrium problem with non-self constraint map exist. Our approach is based on an iterative algorithm which gives rise to a…
A numerical study of an optimal control formulation for a shape optimization problem governed by an elliptic variational inequality is performed. The shape optimization problem is reformulated as a boundary control problem in a fixed…
We consider the problem of finite-horizon optimal control design under uncertainty for imperfectly observed discrete-time systems with convex costs and constraints. It is known that this problem can be cast as an infinite-dimensional convex…