Related papers: On the global convergence of the inexact semi-smoo…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
In this paper, we propose a new method that combines the inexact Newton method with a procedure to obtain a feasible inexact projection for solving constrained smooth and nonsmooth equations. The local convergence theorems are established…
The system of generalized absolute value equations (GAVE) has attracted more and more attention in the optimization community. In this paper, by introducing a smoothing function, we develop a smoothing Newton algorithm with non-monotone…
In this paper, we propose a globally convergent method for solving constrained nonlinear systems. The method combines an efficient Newton conditional gradient method with a derivative-free and nonmonotone linesearch strategy. The global…
We consider the generalized Newton method (GNM) for the absolute value equation (AVE) $Ax-|x|=b$. The method has finite termination property whenever it is convergent, no matter whether the AVE has a unique solution. We prove that GNM is…
We develop a semismooth Newton framework for the numerical solution of fixed-point equations that are posed in Banach spaces. The framework is motivated by applications in the field of obstacle-type quasi-variational inequalities and…
In this paper a special semi-smooth equation associated to the second order cone is studied. It is shown that, under mild assumptions, the semi-smooth Newton method applied to this equation is well-defined and the generated sequence is…
Motivated by the framework constructed by Brugnano and Casulli $[$SIAM J. Sci. Comput. 30: 463--472, 2008$]$, we analyze the finite termination property of the generalized Netwon method (GNM) for solving the absolute value equation (AVE).…
This paper is concerned with an algorithm for finding a singularity of the nonsmooth vector fields. Firstly, we discuss the main results of the Newton method presented in [1] for solving the aforementioned problem. Combining this method…
We first investigate properties of M-tensor equations. In particular, we show that if the constant term of the equation is nonnegative, then finding a nonnegative solution of the equation can be done by finding a positive solution of a…
In this paper, an inverse-free dynamical system with fixed-time convergence is presented to solve the system of absolute value equations (AVEs). Under a mild condition, it is proved that the solution of the proposed dynamical system…
In this paper a special piecewise linear system is studied. It is shown that, under a mild assumption, the semi-smooth Newton method applied to this system is well defined and the method generates a sequence that converges linearly to a…
The convergence of inexact Newton methods is studied for solving generalized equations on Riemannian manifolds by using the metric regularity property, which is also explored. Under appropriate conditions and without any additional…
In this paper, we consider the {\it tensor absolute value equations} (TAVEs), which is a newly introduced problem in the context of multilinear systems. Although the system of TAVEs is an interesting generalization of matrix {\it absolute…
In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an…
In this paper, an inexact Newton method for solving real-valued nonlinear eigenvalue problems with eigenvector dependency (NEPv) is introduced that is able to solve the problem on a matrix level. Our main contribution is to derive a variant…
We propose a higher-order method for solving non-smooth optimization problems on manifolds. In order to obtain superlinear convergence, we apply a Riemannian Semi-smooth Newton method to a non-smooth non-linear primal-dual optimality system…
We herein propose a variant of the projected inexact Levenberg--Marquardt method (ILMM) for solving constrained nonsmooth equations. Since the orthogonal projection onto the feasible set may be computationally expensive, we propose a local…
In this paper we present GSSN, a globalized SCD semismooth* Newton method for solving nonsmooth nonconvex optimization problems. The global convergence properties of the method are ensured by the proximal gradient method, whereas locally…
Despite the impressive numerical performance of the quasi-Newton and Anderson/nonlinear acceleration methods, their global convergence rates have remained elusive for over 50 years. This study addresses this long-standing issue by…