On the public citation graph

An interval version of Shubert's iterative method for the localization of the global maximum

https://doi.org/10.1007/bf02240102
0 signed · 33 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/bf00933139openalex-snapshot
Global optimization using interval analysis: The one-dimensional case
inferredcites →https://doi.org/10.1007/bf01396702openalex-snapshot
Global optimization using interval analysis ? the multi-dimensional case
inferredcites →https://doi.org/10.1007/bf01580772openalex-snapshot
Inclusion functions and global optimization II
inferredcites →https://doi.org/10.1007/bf01584379openalex-snapshot
Inclusion functions and global optimization
inferredcites →https://doi.org/10.1007/bf02241750openalex-snapshot
On computing the range of values
inferredcites →https://doi.org/10.1137/0709036openalex-snapshot
A Sequential Method Seeking the Global Maximum of a Function
inferredcites →https://doi.org/10.1137/0719054openalex-snapshot
Iterative Methods for the Localization of the Global Maximum
inferredcites →https://doi.org/10.1137/1.9781611970906openalex-snapshot
Methods and Applications of Interval Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms1006openalex-snapshot
L ipschitz Global Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_9openalex-snapshot
Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_764-1openalex-snapshot
Lipschitz Expensive Global Optimization
inferred← citeshttps://doi.org/10.1007/bf00121303openalex-snapshot
Unconstrained and constrained global optimization of polynomial functions in one variable
inferred← citeshttps://doi.org/10.1007/bf01580907openalex-snapshot
Convergence qualification of adaptive partition algorithms in global optimization
inferred← citeshttps://doi.org/10.1007/bf01581202openalex-snapshot
Global optimization of univariate Lipschitz functions: I. Survey and properties
inferred← citeshttps://doi.org/10.1007/bf01581203openalex-snapshot
Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison
inferred← citeshttps://doi.org/10.1007/bf02207774openalex-snapshot
Cord-slope form of Taylor's expansion in univariate global optimization
inferred← citeshttps://doi.org/10.1007/bf02243808openalex-snapshot
Interval-majorant method and global optimization
inferred← citeshttps://doi.org/10.1007/s11424-010-7199-5openalex-snapshot
A one-parameter filled function for nonsmooth global optimization and its application
inferred← citeshttps://doi.org/10.1007/s11766-004-0019-8openalex-snapshot
Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems
inferred← citeshttps://doi.org/10.1016/0898-1221(93)90288-7openalex-snapshot
Nonlinear equations and optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2007.06.026openalex-snapshot
Interval method for global solutions of a class of min–max–min problems
inferred← citeshttps://doi.org/10.1016/j.apm.2008.10.015openalex-snapshot
New filled functions for nonsmooth global optimization
inferred← citeshttps://doi.org/10.1016/j.proeng.2012.01.1130openalex-snapshot
Interval Maximum-Entropy Method for Min-Max-Min Problem☆
inferred← citeshttps://doi.org/10.1016/s0096-3003(96)00220-2openalex-snapshot
An interval maximum entropy method for a discrete minimax problem
inferred← citeshttps://doi.org/10.1017/s0004972700030641openalex-snapshot
Topics in Lipschitz global optimisation
inferred← citeshttps://doi.org/10.1023/a:1009994414947openalex-snapshot
An Interval Entropy Penalty Method for Nonlinear Global Optimization
inferred← citeshttps://doi.org/10.1080/10556789408805556openalex-snapshot
On global optimization in R using interval arithmetic
inferred← citeshttps://doi.org/10.1109/chicc.2008.4604915openalex-snapshot
A new global optimized algorithm-interval evolution algorithm
inferred← citeshttps://doi.org/10.1177/1550147721991770openalex-snapshot
Interval analysis-based Bi-iterative algorithm for robust TDOA-FDOA moving source localisation
inferred← citeshttps://doi.org/10.1287/moor.16.2.334openalex-snapshot
On the Number of Iterations of Piyavskii's Global Optimization Algorithm
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30057openalex-snapshot
Cumulative Regret Analysis of the Piyavskii–Shubert Algorithm and Its Variants for Global Optimization
inferred← citeshttps://doi.org/10.3934/naco.2012.2.69openalex-snapshot
Univariate geometric Lipschitz global optimization algorithms
inferred← citeshttps://doi.org/10.4236/am.2012.330187openalex-snapshot
Modified Piyavskii’s Global One-Dimensional Optimization of a Differentiable Function
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.