We discuss the performance of three numerical methods for the fully nonlinear Monge-Ampère equation. The first two are pseudo time continuation methods while the third is a pure pseudo time marching algorithm. The pseudo time continuation methods are shown to converge for smooth data on a uniformly convex domain. We give numerical evidence that they perform well for the nondegenerate Monge-Ampè...

We consider the approximation problem of a pseudo-Boolean function by a symmetric pseudo-Boolean function in the sense of weighted least squares. We give explicit expressions for the approximation and provide interpretations and properties of its L-statistic representation. We also discuss applications of these expressions in cooperative game theory and engineering reliability.

In this paper, we introduce a new class of generalized convex function, namely, α-pseudounivex function, by combining the concepts of pseudo-univex and α-invex functions. Further, we establish some relationships between vector variational-like inequality problems and vector optimization problems under the assumptions of α-pseudo-univex functions. Results obtained in this paper present a refinem...

The natural pseudo-distance is a similarity measure conceived for the purpose of comparing shapes. In this paper we revisit this pseudo-distance from the point of view of quotients. In particular, we show that the natural pseudo-distance coincides with the quotient pseudo-metric on the space of continuous functions on a compact manifold, endowed with the uniform convergence metric, modulo self-...