On Brown's method with convexity hypotheses

Juan Pedro Milaszewicz

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On Brown's method with convexity hypotheses”

An efficient algorithm for computing real powers of a matrix and a related matrix function

Jan Ježek (1988)

Aplikace matematiky

Similarity:

The paper is devoted to an algorithm for computing matrices $A^{r}$ and $(A^{r} - I) . {(A - I)}^{- 1}$ for a given square matrix $A$ and a real $r$ . The algorithm uses the binary expansion of $r$ and has the logarithmic computational complexity with respect to $r$ . The problem stems from the control theory.

Efficient trust region method for nonlinear least squares

Ladislav Lukšan (1996)

Kybernetika

Similarity:

Variable metric method with limited storage for large-scale unconstrained minimization

Ladislav Lukšan (1982)

Kybernetika

Similarity: