On the public citation graph

Note on an extension of “Davidon” methods to nondifferentiable functions

https://doi.org/10.1007/bf01585534
0 signed · 22 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00934971openalex-snapshot
Projection method for unconstrained optimization
inferredcites →https://doi.org/10.1007/bf01585534openalex-snapshot
Note on an extension of “Davidon” methods to nondifferentiable functions
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferredcites →https://doi.org/10.1016/b978-0-12-161901-5.50023-6openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1016/s0022-0000(68)80034-0openalex-snapshot
Algorithms for some minimax problems
inferredcites →https://doi.org/10.1137/0311049openalex-snapshot
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/3008203openalex-snapshot
Integer and Non-Linear Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471787779.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-46329-7_20openalex-snapshot
Dual Methods in Convex Control Problems
inferred← citeshttps://doi.org/10.1007/bf01069305openalex-snapshot
Methods of minimizing functions that satisfy a Lipschitz condition, averaging the directions of descent
inferred← citeshttps://doi.org/10.1007/bf01069307openalex-snapshot
Nonlocal minimization algorithms of nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01069850openalex-snapshot
Properties of functions satisfying a local Lipschitz condition
inferred← citeshttps://doi.org/10.1007/bf01584346openalex-snapshot
On convergence rates of subgradient optimization methods
inferred← citeshttps://doi.org/10.1007/bf01588972openalex-snapshot
On the Fermat—Weber problem with convex cost functions
inferred← citeshttps://doi.org/10.1007/bf01589444openalex-snapshot
The method of successive affine reduction for nonlinear minimization
inferred← citeshttps://doi.org/10.1007/bf01609012openalex-snapshot
A subgradient algorithm for certain minimax and minisum problems
inferred← citeshttps://doi.org/10.1007/s10999-008-9077-zopenalex-snapshot
Advances in computational contact mechanics
inferred← citeshttps://doi.org/10.1016/j.epsr.2013.10.015openalex-snapshot
A comparative analysis of different dual problems in the Lagrangian Relaxation context for solving the Hydro Unit Commitment problem
inferred← citeshttps://doi.org/10.1016/s0020-7403(00)00095-3openalex-snapshot
Solution of dynamic frictional contact problems using nondifferentiable optimization
inferred← citeshttps://doi.org/10.1109/icca69928.2026.11618153openalex-snapshot
A Weighted Bundle Method of Multipliers with Improved Computational Efficiency
showing the first 13 of 14 · page through all 14
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.