Related papers: Comments on finite termination of the generalized …

Recently, a class of inexact Picard iteration method for solving the absolute value equation: $Ax-|x~|=b$ have been proposed in [Optim Lett 8:2191-2202,2014]. To further improve the performance of Picard iteration method, a new inexact…

This paper presents new variants of the averaged alternating modified reflections (AAMR) method for the best approximation problem. Under a mild constraint qualification, we first show its weak convergence and then establish a convergence…

The modeling of electric machines and power transformers typically involves systems of nonlinear magnetostatics or -quasistatics, and their efficient and accurate simulation is required for the reliable design, control, and optimization of…

We describe inexact proximal Newton-like methods for solving degenerate regularized optimization problems and for the broader problem of finding a zero of a generalized equation that is the sum of a continuous map and a maximal monotone…

Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…

The Newton method is a powerful optimization algorithm, valued for its rapid local convergence and elegant geometric properties. However, its theoretical guarantees are usually limited to convex problems. In this work, we ask whether…

We obtain the explicit rate of convergence $N^{-1/2 + \epsilon}$ for the gaps of generalized Wigner matrices in the bulk of the spectrum, for distributions of matrix entries possibly atomic and supported on enough points. The proof proceeds…

This work develops an epsilon-uniform finite element method for singularly perturbed boundary value problems. A surprising and remarkable observation is illustrated: By moving one node arbitrarily in between its adjacent nodes, the new…

In this paper, we study large-scale convex optimization algorithms based on the Newton method applied to regularized generalized self-concordant losses, which include logistic regression and softmax regression. We first prove that our new…

We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized…

In this paper, we extend the previous convergence results for the generalized alternating projection method applied to subspaces in [arXiv:1703.10547] to hold also for smooth manifolds. We show that the algorithm locally behaves similarly…

We propose the generalized Newton's method (GeN) -- a Hessian-informed approach that applies to any optimizer such as SGD and Adam, and covers the Newton-Raphson method as a sub-case. Our method automatically and dynamically selects the…

An inexact Newton type method for numerical minimization of convex piecewise quadratic functions is considered and its convergence is analyzed. Earlier, a similar method was successfully applied to optimizaton problems arising in numerical…

We consider the efficient minimization of a nonlinear, strictly convex functional with $\ell_1$-penalty term. Such minimization problems appear in a wide range of applications like Tikhonov regularization of (non)linear inverse problems…

In this paper, we generalized the known Laplace-transform final-value theorem. From our conclusion, one can deduce the existing results in [1, 3, 12]. By using final value theorem, we give a new proof that Caputo fractional differential…

The authors announce the following theorem. Theorem 1. If $G=A*_H B$ is an amalgamated product where $A$ and $B$ are finitely presented and semistable at infinity, and $H$ is finitely generated, then $G$ is semistable at infinity. If…

In this paper, we study the iteration complexity of cubic regularization of Newton method for solving composite minimization problems with uniformly convex objective. We introduce the notion of second-order condition number of a certain…

A vector bundle E on a projective variety X is called finite if it satisfies a nontrivial polynomial equation with integral coefficients. A theorem of Nori implies that E is finite if and only if the pullback of E to some finite etale…

This paper proposes and justifies two globally convergent Newton-type methods to solve unconstrained and constrained problems of nonsmooth optimization by using tools of variational analysis and generalized differentiation. Both methods are…

We consider a variant of inexact Newton Method, called Newton-MR, in which the least-squares sub-problems are solved approximately using Minimum Residual method. By construction, Newton-MR can be readily applied for unconstrained…