Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2019

2019

In this paper, we introduce two golden ratio algorithms with new stepsize rules for solving pseudomonotone and Lipschitz… Expand

2016

2016

We consider the emphatic temporal-difference (TD) algorithm, ETD($\lambda$), for learning the value functions of stationary… Expand

2011

2011

This paper analyzes the emergence of systemic risk in a network model of interconnected bank balance sheets. Given a shock to… Expand

2008

2008

Abstract
Conjugate gradient methods are efficient methods for minimizing differentiable objective functions in large dimension… Expand

2001

2001

This paper presents a convergence proof technique for a broad class of proximal algorithms in which the perturbation term is… Expand

2001

2001

Explicit pseudo two-step RKN methods with stepsize control ? ? This work was partly supported by DAA

This paper is devoted to variable stepsize strategy implementations of a class of explicit pseudo two-step Runge– Kutta–Nystrom… Expand

1999

1999

Abstract The aim of this paper is to apply a class of constant stepsize explicit pseudo two-step Runge-Kutta methods of… Expand

1994

1994

There is considerable evidence suggesting that for Hamiltonian systems of ordinary differential equations it is better to use… Expand

1986

1986

A systematic way of extending a general fixed-stepsize multistep formula to a minimum storage variable-stepsize formula has been… Expand

Highly Cited

1982

Highly Cited

1982

This paper outlines a number of difficulties which can arise when numerical methods are used to solve systems of differential… Expand