Related papers: Relationships between different types of initial c…

Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…

We derive a hierarchy of continuous-variable multipartite entanglement conditions in terms of second-order moments of position and momentum operators that generalizes existing criteria. Each condition corresponds to a convex optimization…

This paper establishes the necessary and sufficient conditions for the reality of all the zeros in a polynomial sequence $\{P_i\}_{i=1}^{\infty}$ generated by a three-term recurrence relation $P_i(x)+ Q_1(x)P_{i-1}(x) +Q_2(x) P_{i-2}(x)=0$…

We discuss the solvability of an infinite system of first order ordinary differential equations on the half line, subject to nonlocal initial conditions. The main result states that if the nonlinearities possess a suitable "sub-linear"…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…

We introduce a new type of Krasnoselskii's result. Using a simple differentiability condition, we relax the nonexpansive condition in Krasnoselskii's theorem. More clearly, we analyze the convergence of the sequence…

In this paper a special type of difference equations is investigated. The impulses start abruptly at some points and their action continue on given finite intervals. This type of equations is used to model a real process. An algorithm,…

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…

The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…

In this paper we investigate all-at-once versus reduced regularization of dynamic inverse problems on finite time intervals $(0,T)$. In doing so, we concentrate on iterative methods and nonlinear problems, since they have already been shown…

The main purpose of this article is to establish new uniqueness results for Calder\'on type inverse problems related to damped nonlocal wave equations. To achieve this goal we extend the theory of very weak solutions to our setting, which…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

This paper studies proofs of strong convergence of various iterative algorithms for computing the unique zeros of set-valued accretive operators that also satisfy some weak form of uniform accretivity at zero. More precisely, we extract…

We propose a new approach to solving bilevel optimization problems, intermediate between solving full-system optimality conditions with a Newton-type approach, and treating the inner problem as an implicit function. The overall idea is to…

Two new approaches to solving first-order quasilinear elliptic systems of PDEs in many dimensions are proposed. The first method is based on an analysis of multimode solutions expressible in terms of Riemann invariants, based on links…

We are concerned with the tensor equation with an M-tensor or Z-tensor, which we call the M- tensor equation or Z-tensor equation respectively. We derive a necessary and sufficient condition for a Z (or M)-tensor equation to have…

The paper concerns with novel first-order methods for monotone variational inequalities. They use a very simple linesearch procedure that takes into account a local information of the operator. Also the methods do not require…

For a product of i.i.d. random maps or a memoryless stochastic flow on a compact space $X$, we find conditions under which the presence of locally asymptotically stable trajectories (e.g. as given by negative Lyapunov exponents) implies…