Related papers: Throwing a Ball as Far as Possible, Revisited
This paper presents an analytical framework to study the geometry arising when a soft continuum arm grasps a planar object. Both the arm centerline and the object boundary are modeled as smooth curves. The grasping problem is formulated as…
This paper is concerned with the optimal upper bound on mean quantities (torque, dissipation and the Nusselt number) obtained in the framework of the background method for the Taylor--Couette flow with a stationary outer cylinder. Along the…
A classic problem of the motion of a point mass (projectile) thrown at an angle to the horizon is reviewed. The air drag force is taken into account with the drag factor assumed to be constant. Analytic approach is used for investigation.…
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…
We consider finite element approximations of ill-posed elliptic problems with conditional stability. The notion of {\emph{optimal error estimates}} is defined including both convergence with respect to mesh parameter and perturbations in…
We present a methodology for bounding the error term of an asymptotic solution to a singularly perturbed optimal control (SPOC) problem whose exact solution is known to be computationally intractable. In previous works, reduced or…
We present two criteria for checking approximate proper efficiency in vector optimization problems with the ordering cone being a nonnegative orthant. Although the criteria can be established by Benson's approach [H.P. Benson, \textit{An…
In 1934, Reinhardt conjectured that the shape of the centrally symmetric convex body in the plane whose densest lattice packing has the smallest density is a smoothed octagon. This conjecture is still open. We formulate the Reinhardt…
Large sectors of the recent optimization literature focused in the last decade on the development of optimal stochastic first order schemes for constrained convex models under progressively relaxed assumptions. Stochastic proximal point is…
In recent study in Ref.[7] (arXiv: 2401.12525), we have introduced a method aimed at calculating the weak-field asymptotic deflection angle. This method offers an efficient computational approach that avoids the complexities of integration…
Three theoretical criteria for gravitational theories beyond general relativity are considered: obtaining the cosmological constant as an integration constant, deriving the energy conservation law as a consequence of the field equations,…
In this paper, the problem of finite horizon inverse optimal control (IOC) is investigated, where the quadratic cost function of a dynamic process is required to be recovered based on the observation of optimal control sequences. We propose…
We consider smooth stochastic convex optimization problems in the context of algorithms which are based on directional derivatives of the objective function. This context can be considered as an intermediate one between derivative-free…
In this paper, we aim to investigate the optimal decay rate for the higher order spatial derivative of global solution to the full compressible Navier-Stokes (CNS) equations with potential force in $\mathbb{R}^3$. We establish the optimal…
Consider the problem of finding an optimal value of some objective functional subject to constraints over numerical domain. This type of problem arises frequently in practical engineering tasks. Nowdays almost all general methods for…
We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.
It has been a widely belief that for a planar convex domain with two coordinate axes of symmetry, the location of maximal norm of gradient of torsion function is either linked to contact points of largest inscribed circle or connected to…
We propose a Model Predictive Control (MPC) with a single-step prediction horizon to approximate the solution of infinite horizon optimal control problems with the expected sum of convex stage costs for constrained linear uncertain systems.…
This paper considers a conceptual version of a convex optimization algorithm whic is based on replacing a convex optimization problem with the root-finding problem for the approximate sub-differential mapping which is solved by repeated…
In a domain of the Euclidean space, we estimate from below the distance to the boundary of global maximum points of solutions of elliptic and parabolic equations with homogeneous Dirichlet boundary values. As reference cases, we first…