<Para ID="Par1">We present a local convergence analysis of Gauss-Newton method for solving nonlinear least square problems. Using more precise majorant conditions than in earlier studies such as Chen (Comput Optim Appl 40:97–118, <CitationRef CitationID="CR8">2008</CitationRef>), Chen and Li (Appl Math Comput 170:686–705, <CitationRef CitationID="CR9">2005</CitationRef>), Chen and Li (Appl...</citationref></citationref></para>

We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience. In the past, SAP methods were formulated with a single predetermined set of...

Nemirovski’s analysis (SIAM J. Optim. 15:229–251, <CitationRef CitationID="CR15">2005</CitationRef>) indicates that the extragradient method has the O(1/t) convergence rate for variational inequalities with Lipschitz continuous monotone operators. For the same problems, in the last decades, a class of Fejér monotone projection and...</citationref>

In general the infimal value of a mathematical program with variational inequality constraints (MPVI) is not stable under perturbations in the sense that the sequence of infimal values for the perturbed programs may not converge to the infimal value of the original problem even in presence of...

We present a double projection algorithm for solving variational inequalities without monotonicity. If the solution of dual variational inequality does exist, then the sequence produced by our method is globally convergent to a solution. Under the same assumption, the sequence produced by known...