On the public citation graph

QDN: a variable storage algorithm for unconstrained optimization

https://doi.org/10.2172/5455307
0 signed · 16 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf00939421openalex-snapshot
A quasi-discrete Newton algorithm with a nonmonotone stabilization technique
inferred← citeshttps://doi.org/10.1007/bf00940345openalex-snapshot
A truncated Newton method with nonmonotone line search for unconstrained optimization
inferred← citeshttps://doi.org/10.1007/bf01385810openalex-snapshot
A class of nonmonotone stabilization methods in unconstrained optimization
inferred← citeshttps://doi.org/10.1007/bf01583777openalex-snapshot
A discrete Newton algorithm for minimizing a function of many variables
inferred← citeshttps://doi.org/10.1007/bf02252985openalex-snapshot
A class of nonmonotone stabilization trust region methods
inferred← citeshttps://doi.org/10.1007/bf02592055openalex-snapshot
Truncated-Newton algorithms for large-scale unconstrained optimization
inferred← citeshttps://doi.org/10.1007/bfb0042786openalex-snapshot
Newton-type algorithms with nonmonotone line search for large-scale unconstrained optimization
inferred← citeshttps://doi.org/10.1080/02331939408844021openalex-snapshot
A variant of curved search method
inferred← citeshttps://doi.org/10.1080/10556789408805558openalex-snapshot
Some more numerical experiments with LSNNO, a Fortran subroutine for solving large-scale nonlinear network optimization problems
inferred← citeshttps://doi.org/10.1109/cdc.1983.269824openalex-snapshot
A user's guide to nonlinear optimization algorithms
inferred← citeshttps://doi.org/10.1109/proc.1984.13085openalex-snapshot
A user's guide to nonlinear optimization algorithms
inferred← citeshttps://doi.org/10.1137/0724031openalex-snapshot
A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection Methods
inferred← citeshttps://doi.org/10.1137/0905039openalex-snapshot
Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
inferred← citeshttps://doi.org/10.1137/s1052623494266365openalex-snapshot
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
inferred← citeshttps://doi.org/10.1145/1218052.1218056openalex-snapshot
Optimization
inferred← citeshttps://doi.org/10.1145/131766.131771openalex-snapshot
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.