Related papers: Restricted normal cones and the method of alternat…
Piecewise affine maps (PAMs) are frequently used as a reference model to show the openness of the reachability questions in other systems. The reachability problem for one-dimentional PAM is still open even if we define it with only two…
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ…
Special-generic-like maps or SGL maps are introduced by the author motivated by observing and investigating algebraic topological or differential topological properties of manifolds via nice smooth maps whose codimensions are negative. The…
Maximum a posteriori (MAP) inference is an important task for graphical models. Due to complex dependencies among variables in realistic model, finding an exact solution for MAP inference is often intractable. Thus, many approximation…
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges.…
Given a convex set and an interior point close to the boundary, we prove the existence of a supporting hyperplane whose distance to the point is controlled, in a dimensionally quantified way, by the thickness of the convex set in the…
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
A linearly constrained framework in $\mathbb{R}^d$ is a bar-joint framework where, in addition, vertices with loops are constrained to lie in given affine subspaces. In the generic case, when each vertex is incident to sufficiently many…
In this paper, we introduce two novel parallel projection methods for finding a solution of a system of variational inequalities which is also a common fixed point of a family of (asymptotically) $\kappa$ - strict pseudocontractive…
A continous map $f: \mathbb{C}^n \rightarrow \mathbb{C}^N$ is $k$-regular if the image of any $k$ points spans a $k$-dimensional subspace. It is an important problem in topology and interpolation theory, going back to Borsuk and Chebyshev,…
The proximal, regular and limiting normal cones to the second-order cone complementarity set play important roles in studying mathematical programs with second-order cone complementarity constraints, second-order cone programs, and the…
We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and…
We extend the recent result of T.Tao to wave maps defined from the Minkowski space of dimension >4 to a target Riemannian manifold which possesses a ``bounded parallelizable'' structure. This is the case of Lie groups, homogeneous spaces as…
We establish the asymptotic regularity and the $\Delta$-convergence of the sequence constructed by the alternating projections to closed convex sets in a CAT($\kappa$) space with $\kappa > 0$. Furthermore, the strong convergence of the…
This work proposes a novel convex-non-convex formulation of the image segmentation and the image completion problems. The proposed approach is based on the minimization of a functional involving two distinct regularization terms: one…
Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem of low-rank matrix completion, this method is believed to…
Hidden convexity is a powerful idea in optimization: under the right transformations, nonconvex problems that are seemingly intractable can be solved efficiently using convex optimization. We introduce the notion of a Lagrangian dual…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
The concept of regularity in the meta-topological setting of projections in the double dual of a C*-algebra addresses the interrelations of a projection p with its closure, for instance in the form that such projections act identically, in…
In this article we combine the projective Landweber method, recently proposed by the authors, with Kaczmarz's method for solving systems of non-linear ill-posed equations. The underlying assumption used in this work is the tangential cone…