‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

In the Newton/log-barriermethod,Newton steps are taken for the log-barrier function for a xed value of the barrier parameter until a certain convergence criterion is satis ed. The barrier parameter is then decreased and the Newton process is repeated. A naive analysis indicates that Newton's method does not exhibit superlinear convergence to the minimizer of each instance of the log-barrier fun...

Large-scale logistic regression arises in many applications such as document classification and natural language processing. In this paper, we apply a trust region Newton method to maximize the log-likelihood of the logistic regression model. The proposed method uses only approximate Newton steps in the beginning, but achieves fast convergence in the end. Experiments show that it is faster than...

Convergence properties are presented for Newton additive and multiplicative Schwarz iterative methods for the solution of nonlinear systems in several variables. These methods consist of approximate solutions of the linear Newton step using either additive or multiplicative Schwarz iterations, where overlap between subdomains can be used. Restricted versions of these methods are also considered...

This paper describes a method of dogleg trust-region steps, or restricted Levenberg-Marquardt steps, based on a projection process onto the Krylov subspaces for neural networks nonlinear least squares problems. In particular, the linear conjugate gradient (CG) method works as the inner iterative algorithm for solving the linearized Gauss-Newton normal equation, whereas the outer nonlinear algor...

We introduce a well-developed Newton iterative (truncated Newton) algorithm for solving large-scale nonlinear systems. The framework is an inexact Newton method globalized by backtracking. Trial steps are obtained using one of several Krylov subspace methods. The algorithm is implemented in a Fortran solver called NITSOL that is robust yet easy to use and provides a number of useful options and...

We show that a lithium experiment has a potential to confirm or reject the value 1.5% of the solar luminosity attributed to a CNO-cycle by the standard solar model and to prove that the difference between total energy release of the Sun and what is produced in a hydrogen sequence is really produced in CNO cycle. This will be the stringent test of the theory of stellar evolution and the terminat...

Coarse structures involving low electrical contrasts can be profitably imaged by means of cheap and relatively simple methods such as travel time tomography, whereas fine structure involving sub-wavelength detail can only be recovered by inverting full-waveform data. Despite its complexity and high computation costs, full-waveform inversion of GPR data has become a popular tool for high-resolut...