On the public citation graph
Cord-slope form of Taylor's expansion in univariate global optimization
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-30863-6_7openalex-snapshot
Differential- und Integralrechnung
inferredcites →https://doi.org/10.1007/bf00933139openalex-snapshot
Global optimization using interval analysis: The one-dimensional case
inferredcites →https://doi.org/10.1007/bf01138943openalex-snapshot
Sequential search algorithm for the largest value of a twice differentiable function
inferredcites →https://doi.org/10.1007/bf01396702openalex-snapshot
Global optimization using interval analysis ? the multi-dimensional case
inferredcites →https://doi.org/10.1007/bf01581203openalex-snapshot
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
inferredcites →https://doi.org/10.1007/bf02240102openalex-snapshot
An interval version of Shubert's iterative method for the localization of the global maximum
inferredcites →https://doi.org/10.1016/0022-247x(78)90128-2openalex-snapshot
A global minimization algorithm for a class of one-dimensional functions
inferredcites →https://doi.org/10.1016/0041-5553(71)90008-5openalex-snapshot
Optimal strategies of the search for an extremum
inferredcites →https://doi.org/10.1016/0041-5553(71)90065-6openalex-snapshot
Numerical methods for finding global extrema (Case of a non-uniform mesh)
inferredcites →https://doi.org/10.1016/0041-5553(77)90133-1openalex-snapshot
Optimal passive algorithms for evaluating the maximum of a function in an interval
inferredcites →https://doi.org/10.1016/0041-5553(78)90036-8openalex-snapshot
Optimal strategies for seeking the global maximum of a function
inferredcites →https://doi.org/10.1016/0041-5553(82)90065-9openalex-snapshot
On optimal search strategies for the maximum of a function with bounded highest derivative
inferredcites →https://doi.org/10.1016/0378-4754(85)90023-0openalex-snapshot
Computer methods for the range of functions
inferredcites →https://doi.org/10.1016/0378-4754(89)90184-5openalex-snapshot
New computer methods for global optimization
inferredcites →https://doi.org/10.1016/b978-0-12-468662-5.50014-8openalex-snapshot
FINDING THE GLOBAL MINIMUM OF A FUNCTION OF ONE VARIABLE USING THE METHOD OF CONSTANT SIGNED HIGHER ORDER DERIVATIVES11Research supported by Army Research Office under contract DAAG-79-C-0062 and Office of Naval Research contract N00014-75-C-0729.
inferredcites →https://doi.org/10.1057/jors.1990.45openalex-snapshot
New Computer Methods for Global Optimization
inferredcites →https://doi.org/10.1080/00207168908803738openalex-snapshot
Global minimization of univariate functions by sequential polynomial approximation
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0312365-xopenalex-snapshot
On Descent from Local Minima
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0371062-9openalex-snapshot
Table errata: Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N. J., 1973)
inferredcites →https://doi.org/10.1137/0709036openalex-snapshot
A Sequential Method Seeking the Global Maximum of a Function
inferredcites →https://doi.org/10.1515/9781400862528openalex-snapshot
Recent Advances in Global Optimization
inferredcites →https://doi.org/10.1515/9781400862528.200openalex-snapshot
One Dimensional Global Optimization Using Linear Lower Bounds
inferredcites →https://doi.org/10.2307/2005713openalex-snapshot
Algorithms for Minimization Without Derivatives
inferredcites →https://doi.org/10.2307/2008155openalex-snapshot
Computer Methods for the Range of Functions.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_232openalex-snapshot
αBB algorithm; Automatic differentiation: Point and interval; Automatic differentiation: Point and interval Taylor operators; Bounding derivative ranges; Continuous global optimization: Applications; Continuous global optimization: Models, algorithms and software; Global optimization: Application…
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_306openalex-snapshot
Interval Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-7091-6282-8_15openalex-snapshot
Nonsmooth Global Optimization
inferred← citeshttps://doi.org/10.1007/bf01096413openalex-snapshot
Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
inferred← citeshttps://doi.org/10.1007/s10898-006-9045-9openalex-snapshot
Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis
inferred← citeshttps://doi.org/10.1016/j.amc.2004.09.050openalex-snapshot
A new pruning test for finding all global minimizers of nonsmooth functions
inferred← citeshttps://doi.org/10.1016/j.amc.2004.10.050openalex-snapshot
Optimal centers in branch-and-prune algorithms for univariate global optimization
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00417-4openalex-snapshot
Applications of interval arithmetic in non-smooth global optimization
inferred← citeshttps://doi.org/10.1023/a:1008229430888openalex-snapshot
A Multivariate Global Optimization Using Linear Bounding Functions
inferred← citeshttps://doi.org/10.1023/a:1008354711345openalex-snapshot
Multisection in Interval Branch-and-Bound Methods for Global Optimization – I. Theoretical Results
inferred← citeshttps://doi.org/10.1023/a:1008391326993openalex-snapshot
A Nonsmooth Global Optimization Technique Using Slopes: The One-Dimensional Case
inferred← citeshttps://doi.org/10.1051/ro:2006024openalex-snapshot
Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
inferred← citeshttps://doi.org/10.1109/tcyb.2015.2493161openalex-snapshot
Semi-Supervised SVM With Extended Hidden Features
inferred← citeshttps://doi.org/10.12681/eadd/14327openalex-snapshot
Διαστηματική ανάλυση και ολική βελτιστοποίηση
inferred← citeshttps://doi.org/10.1515/ijnaoe-2015-0030openalex-snapshot
Doppler-shift estimation of flat underwater channel using data-aided least-square approach
inferred← citeshttps://doi.org/10.3233/jifs-181048openalex-snapshot
A novel multi-view SVM based on consistent hidden density distributions between views for face recognition
inferred← citeshttps://doi.org/10.7717/peerj-cs.1874openalex-snapshot
Electroencephalography (EEG) based epilepsy diagnosis via multiple feature space fusion using shared hidden space-driven multi-view learning
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.