The paper introduces an algorithm to compute steepest descent paths on multivariate piecewise-linear functions on Euclidean domains of arbitrary dimensions and topolog
AbstractThe method of steepest descent, also known as the saddle-point method, is a natural developm...
The method of steepest-descent is re-visited in continuous time. It is shown that the continuous tim...
Finding optimal paths in non-homogeneous terrains is a class of problem that presents itself in many...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
We are interested in the asymptotic behavior of the trajectories of the famous steepest descent evol...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
In this article we consider the problem of finding the solution of a system of differential inequal...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases ...
In this paper, we propose an algorithm for computing a shortest descending path from a start point s...
We present an approximate algorithm for the shortest descending path (SDP) problem. Given a source s...
The article is dedicated of memory of Professor V. F. Demyanov (1938—2014). The main scientific int...
This paper revisits the ideas of seeking unconstrained minima by following a continuous steepest des...
Steepest descent method is a simple gradient method for optimization. This method has a slow converg...
The method of steepest descent is applied to a nonlinearly constrained optimization problem which ar...
Abstract. Steepest descent is central in variational mathematics. We present a new transpar-ent exis...
AbstractThe method of steepest descent, also known as the saddle-point method, is a natural developm...
The method of steepest-descent is re-visited in continuous time. It is shown that the continuous tim...
Finding optimal paths in non-homogeneous terrains is a class of problem that presents itself in many...
AbstractA path from s to t on a polyhedral terrain is descending if the height of a point p never in...
We are interested in the asymptotic behavior of the trajectories of the famous steepest descent evol...
Introduction Piecewise linear algorithms, also referred to in the literature as simplicial algorith...
In this article we consider the problem of finding the solution of a system of differential inequal...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases ...
In this paper, we propose an algorithm for computing a shortest descending path from a start point s...
We present an approximate algorithm for the shortest descending path (SDP) problem. Given a source s...
The article is dedicated of memory of Professor V. F. Demyanov (1938—2014). The main scientific int...
This paper revisits the ideas of seeking unconstrained minima by following a continuous steepest des...
Steepest descent method is a simple gradient method for optimization. This method has a slow converg...
The method of steepest descent is applied to a nonlinearly constrained optimization problem which ar...
Abstract. Steepest descent is central in variational mathematics. We present a new transpar-ent exis...
AbstractThe method of steepest descent, also known as the saddle-point method, is a natural developm...
The method of steepest-descent is re-visited in continuous time. It is shown that the continuous tim...
Finding optimal paths in non-homogeneous terrains is a class of problem that presents itself in many...
DOI
Add to ORKG