It is with the aim of solving scheduling problems with irregular cost functions that this paper focuses on the continuous assignment problem. It consists in partitioning a region of R into subregions of prescribed volumes so that the total cost is minimized. The dual problem of the continuous assignment problem is an unconstrained maximisation of a non-smooth concave function. The preemptive va...

This paper presents a computational impact angle control guidance law based on the energy cost weighted by arbitrary functions in order to shape acceleration command as desired. The optimal problem is established frame and solved Gauss orthogonal collocation method. proposed formulated from generalized framework, thus new that allows achieving specific goal can be easily obtained way of devisin...

In this paper, we address a cooperative game application to supply chain management. Specifically, we study a distribution system where a set of retailers may order for a single product from a unique supplier to satisfy a deterministic and constant rate demand of final customers. Each retailer, when ordering for a quantity of product, has to pay a fixed ordering cost and a transportation cost. ...

Most 3D shape analysis methods use triangular meshes to discretize both the shape and functions on it as piecewise linear functions. With this representation, shape analysis requires fine meshes to represent smooth shapes and geometric operators like normals, curvatures, or LaplaceBeltrami eigenfunctions at large computational and memory costs. We avoid this bottleneck with a compression techni...

In this article we analyze the optimal control strategy for rotating a monitored qubit from an initial pure state to an orthogonal state in minimum time. This strategy is described for two different cost functions of interest which do not have the usual regularity properties. Hence, as classically smooth cost functions may not exist, we interpret these functions as viscosity solutions to the op...

In this paper we propose a new approach for constructing efficient schemes for non-smooth convex optimization. It is based on a special smoothing technique, which can be applied to functions with explicit max-structure. Our approach can be considered as an alternative to black-box minimization. From the viewpoint of efficiency estimates, we manage to improve the traditional bounds on the number...

We present some algorithms for solving a number of new models of facility location which generalize the classical Fermat-Torricelli problem. Our first approach involves using the MM Principle and Nesterov’s smoothing technique to build smooth approximations that are convenient for applying smooth optimization schemes. Another approach uses subgradient-type algorithms to cope directly with the n...

We consider the possibility of using locally supported quasi-interpolation operators for the approximation of univariate non-smooth functions. In such a case one usually expects the rate of approximation to be lower than that of smooth functions. It is shown in this paper that prior knowledge of the type of ’singularity’ of the function can be used to regain the full approximation power of the ...

We are concerned with the existence of smooth time functions on connected time–oriented Lorentzian manifolds. The problem is tackled in a more general abstract setting, namely in a manifold M where is just defined a field of tangent convex cones (Cx)x∈M enjoying mild continuity properties. Under some conditions on its integral curves, we will construct a time function. Our approach is based on ...