Related papers: Projection onto simplicial cones by a semi-smooth …
We are concerned with the tensor equations whose coefficient tensor is an M-tensor. We first propose a Newton method for solving the equation with a positive constant term and establish its global and quadratic convergence. Then we extend…
We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume. This construction can be used either to efficiently "simplify a complicated space" by realizing it…
This paper concerns developing a numerical method of the Newton type to solve systems of nonlinear equations described by nonsmooth continuous functions. We propose and justify a new generalized Newton algorithm based on graphical…
This work considers the nonconvex, nonsmooth problem of minimizing a composite objective of the form $f(g(x))+h(x)$ where the inner mapping $g$ is a smooth finite summation or expectation amenable to variance reduction. In such settings,…
We develop a randomized Newton's method for solving differential equations, based on a fully connected neural network discretization. In particular, the randomized Newton's method randomly chooses equations from the overdetermined nonlinear…
An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…
We focus on finding sparse and least-$\ell_1$-norm solutions for unconstrained nonlinear optimal control problems. Such optimization problems are non-convex and non-smooth, nevertheless recent versions of Newton method for under-determined…
We consider the problem of finding the best approximation point from a polyhedral set, and its applications, in particular to solving large-scale linear programs. The classical projection problem has many various and many applications. We…
Closed form solutions for the computation of the solid angle from polygonal cross-sections are well known, however similar formulae for computation of projected solid angle are not generally available. Formulae for computing the projected…
The paper suggests a method of extrapolation of notion of one-sided semi-infinite sequences representing traces of two-sided band-limited sequences; this features ensure uniqueness of this extrapolation and possibility to use this for…
The paper starts with a concise description of the recently developed semismooth* Newton method for the solution of general inclusions. This method is then applied to a class of variational inequalities of the second kind. As a result, one…
Newton method is one of the most powerful methods for finding solutions of nonlinear equations and for proving their existence. In its "pure" form it has fast convergence near the solution, but small convergence domain. On the other hand…
We give a general procedure for gluing together possibly noncompact manifolds of constant scalar curvature which satisfy an extra nondegeneracy hypothesis. Our aim is to provide a simple paradigm for making `analytic' connected sums. In…
We present a partitioned Model Order Reduction method for multiphysics problems, that is based on a semi-implicit treatment of the coupling conditions, and on a projection scheme. The proposed Reduced Order Method is based on the Proper…
In this paper, we investigate global convergence properties of the inexact nonsmooth Newton method for solving the system of absolute value equations (AVE). Global $Q$-linear convergence is established under suitable assumptions. Moreover,…
We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the…
In this paper, an idea to solve nonlinear equations is presented. During the solution of any problem with Newton's Method, it might happen that some of the unknowns satisfy the convergence criteria where the others fail. The convergence…
In this paper, we consider the feasibility problem, which aims to find a feasible point for the constraint set $\{x \in \mathbb{R}^n: c(x) = 0\}$ over a possibly non-regular subset $\mathcal{X} \subset \mathbb{R}^n$. Under the constraint…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…