A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search

Douglas Bunker; Lixing Han; Shu Hua Zhang

Displaying similar documents to “A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search”

How to increase convergence order of the Newton method to $2 \times m$ ?

Sanjay Kumar Khattri (2014)

Applications of Mathematics

Similarity:

We present a simple and effective scheme for forming iterative methods of various convergence orders. In this scheme, methods of various convergence orders, such as four, six, eight and ten, are formed through a modest modification of the classical Newton method. Since the scheme considered is a simple modification of the Newton method, it can be easily implemented in existing software packages, which is also suggested by the presented pseudocodes. Finally some problems are solved, to...

Globalization of SQP-methods in control of the instationary Navier-Stokes equations

Michael Hintermüller, Michael Hinze (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

A numerically inexpensive globalization strategy of sequential quadratic programming methods (SQP-methods) for control of the instationary Navier Stokes equations is investigated. Based on the proper functional analytic setting a convergence analysis for the globalized method is given. It is argued that the a priori formidable SQP-step can be decomposed into linear primal and linear adjoint systems, which is amenable for existing CFL-software. A report on a numerical test demonstrates...