On the complexity of the steepest-descent with exact linesearches | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

On the complexity of the steepest-descent with exact linesearches

Identifier:nobleid.org/w1/20260524/2DEE02F6

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/2DEE02F6.svg?ark=w1%2F20260524%2F2DEE02F6)](https://nobleid.org/work/w1/20260524/2DEE02F6)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Nicholas I. M. Gould

Philippe L. Toint

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy