On the public citation graph

Kriterien zweiter Ordnung f�r lokal beste Approximationen

https://doi.org/10.1007/bf01436923
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.1002/zamm.19660460544openalex-snapshot
G. Meinardus, Approximation von Funktionen und ihre numerische Behandlung. (Springer Tracts in Natural Philosophy, Ergebnisse der angewandten Mathematik, Vol. 4) VIII + 180 S. m. 21 Abb. Berlin/Göttingen/Heidelberg/New York 1964. Springer‐Verlag. Preis geb. DM 49,–
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_12openalex-snapshot
Second Order Conditions for Constrained Minima
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-85646-4openalex-snapshot
Approximation von Funktionen und ihre numerische Behandlung
inferredcites →https://doi.org/10.1007/bf02165377openalex-snapshot
Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
inferredcites →https://doi.org/10.1137/0115056openalex-snapshot
Second Order Conditions for Constrained Minima

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-09519-5_86openalex-snapshot
A note on methods for solving systems of polynomial equations with floating point coefficients
inferred← citeshttps://doi.org/10.1007/978-3-0348-6285-1_14openalex-snapshot
H-Mengen und Minimalbedingungen bei Approximationsproblemen
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-46477-5_10openalex-snapshot
A Three-Phase Algorithm for Semi-Infinite Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_7openalex-snapshot
Semi-Infinite Programming and Applications
inferred← citeshttps://doi.org/10.1007/bf00933151openalex-snapshot
Higher-order necessary conditions in abstract mathematical programming
inferred← citeshttps://doi.org/10.1007/bf01390337openalex-snapshot
Strong uniqueness
inferred← citeshttps://doi.org/10.1007/bf01419533openalex-snapshot
Kriterien erster und zweiter Ordnung f�r lokal beste Approximationen bei Problemen mit Nebenbedingungen
inferred← citeshttps://doi.org/10.1007/bfb0003882openalex-snapshot
Necessary conditions of higher order for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0003883openalex-snapshot
On numerical analysis in semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0003889openalex-snapshot
On semi-infinite programming in numerical analysis
inferred← citeshttps://doi.org/10.1007/bfb0006502openalex-snapshot
Semi-infinite programming: Conditions of optimality and applications
inferred← citeshttps://doi.org/10.1007/bfb0087410openalex-snapshot
A newton-method for nonlinear Chebyshev approximation
inferred← citeshttps://doi.org/10.1016/0021-9045(81)90061-7openalex-snapshot
On the local continuity of the Chebyshev operator
inferred← citeshttps://doi.org/10.1137/0715087openalex-snapshot
Computing Improved Chebyshev Approximations by the Continuation Method. I: Description of an Algorithm
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
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.