In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

We consider a gradient interface model on the lattice with interaction potential which is a non-convex perturbation of a convex potential. We show using a one-step multiple scale analysis the strict convexity of the surface tension at high temperature. This is an extension of Funaki and Spohn’s result [10], where the strict convexity of potential was crucial in their proof. AMS 2000 Subject Cla...

We prove that if a convex body has absolutely continuous surface area measure, whose density is sufficiently close to the constant, then the sequence {ΠK} of convex bodies converges to the ball with respect to the Banach-Mazur distance, asm→∞. Here, Π denotes the projection body operator. Our result allows us to show that the ellipsoid is a local solution to the conjectured inequality of Petty ...

We construct and study a natural homeomorphism between the moduli space of polynomial cubic differentials of degree d on the complex plane and the space of projective equivalence classes of oriented convex polygons with d+3 vertices. This map arises from the construction of a complete hyperbolic affine sphere with prescribed Pick differential, and can be seen as an analogue of the Labourie– Lof...

The notion of a bead metric space is defined as a nice generalization of the uniformly convex normed space such as $CAT(0)$ space, where the curvature is bounded from above by zero. In fact, the bead spaces themselves can be considered in particular as natural extensions of convex sets in uniformly convex spaces and normed bead spaces are identical with uniformly convex spaces. In this paper, w...

We consider a gradient interface model on the lattice with interaction potential which is a non-convex perturbation of a convex potential. We show using a one-step multiple scale analysis the strict convexity of the surface tension at high temperature. This is an extension of Funaki and Spohn’s result [10], where the strict convexity of potential was crucial in their proof. AMS 2000 Subject Cla...

In deep learning, depth, as well as nonlinearity, create non-convex loss surfaces. Then, does depth alone create bad local minima? In this paper, we prove that without nonlinearity, depth alone does not create bad local minima, although it induces non-convex loss surface. Using this insight, we greatly simplify a recently proposed proof to show that all of the local minima of feedforward deep l...

We propose a spatially continuous formulation of Ishikawa’s discrete multi-label problem. We show that the resulting non-convex variational problem can be reformulated as a convex variational problem via embedding in a higher dimensional space. This variational problem can be interpreted as a minimal surface problem in an anisotropic Riemannian space. In several stereo experiments we show that ...

A smooth surface interpolation scheme for positive and convex data has been developed. This scheme has been extended from the rational quadratic spline function of Sarfraz [11] to a rational bi-quadratic spline function. Simple data dependent constraints are derived on the free parameters in the description of rational bi-quadratic spline function to preserve the shape of 3D positive and convex...

vendor managed inventory is a continuous replenishment program that is designed to provide major cost saving benefits for both vendors and retailers. previous research on this area mainly included single objective optimization models where the objective is to minimize the total supply chain costs or to maximize the total supply chain benefits. this paper presents a bi-objective mathematical mod...