On the public citation graph

Interval extensions of non-smooth functions for global optimization and nonlinear systems solvers

https://doi.org/10.1007/bf02276877
0 signed · 38 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/978-1-4613-3437-8_12openalex-snapshot
Test Results for an Interval Branch and Bound Algorithm for Equality-Constrained Optimization
inferredcites →https://doi.org/10.1007/978-3-642-78423-1openalex-snapshot
Numerical Toolbox for Verified Computing I
inferredcites →https://doi.org/10.1007/978-3-7091-6957-5_18openalex-snapshot
FORTRAN-SC A Study of a FORTRAN Extension for Engineering/Scientific Computation with Access to ACRITH
inferredcites →https://doi.org/10.1007/bf01581628openalex-snapshot
A smoothing-out technique for min—max optimization
inferredcites →https://doi.org/10.1007/bf01933221openalex-snapshot
Solving minimax problems by interval methods
inferredcites →https://doi.org/10.1007/bf02310100openalex-snapshot
FORTRAN-SC a study of a FORTRAN extension for engineering/scientific computation with access to ACRITH
inferredcites →https://doi.org/10.1016/0378-4754(89)90184-5openalex-snapshot
New computer methods for global optimization
inferredcites →https://doi.org/10.1016/c2009-0-21898-8openalex-snapshot
Introduction to Interval Computation
inferredcites →https://doi.org/10.1016/s0076-5392(08)62840-4openalex-snapshot
PASCAL-XSC New Concepts for Scientific Computation and Numerical Data Processing
inferredcites →https://doi.org/10.1016/s0076-5392(08)62842-8openalex-snapshot
C-XSC A Programming Environment for Verified Scientific Computing and Numerical Data Processing
inferredcites →https://doi.org/10.1017/cbo9780511526473openalex-snapshot
Interval Methods for Systems of Equations
inferredcites →https://doi.org/10.1057/jors.1990.45openalex-snapshot
New Computer Methods for Global Optimization
inferredcites →https://doi.org/10.1137/1.9781611970906openalex-snapshot
Methods and Applications of Interval Analysis
inferredcites →https://doi.org/10.1137/s1064827594266131openalex-snapshot
Empirical Evaluation of Innovations in Interval Branch and Bound Algorithms for Nonlinear Systems
inferredcites →https://doi.org/10.1145/198429.198433openalex-snapshot
Algorithm 737: INTLIB—a portable Fortran 77 interval standard-function library
inferredcites →https://doi.org/10.1145/200979.200991openalex-snapshot
A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization
inferredcites →https://doi.org/10.1201/9780203026922openalex-snapshot
Global Optimization Using Interval Analysis
inferredcites →https://doi.org/10.15480/882.325openalex-snapshot
Verification methods for dense and sparse systems of equations
inferredcites →https://doi.org/10.2307/2153591openalex-snapshot
Global Optimization Using Interval Analysis.
inferredcites →https://doi.org/10.5445/ir/41092openalex-snapshot
Automatische Ergebnisverifikation bei globalen Optimierungsproblemen

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-319-11683-9_3openalex-snapshot
Preventing Premature Convergence and Proving the Optimality in Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-24738-8_3openalex-snapshot
Libraries, Tools, and Interactive Systems for Verified Computations Four Case Studies
inferred← citeshttps://doi.org/10.1007/978-3-540-74581-5_31openalex-snapshot
A Global Optimization Algorithm Based on Novel Interval Analysis for Training Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_6openalex-snapshot
ε-Intervals in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/s10614-008-9159-xopenalex-snapshot
Impacts of Interval Computing on Stock Market Variability Forecasting
inferred← citeshttps://doi.org/10.1007/s11075-023-01551-8openalex-snapshot
Algorithmic differentiation and hull-consistency enforcing using C++ template meta-programming
inferred← citeshttps://doi.org/10.1007/s11590-018-1315-1openalex-snapshot
A new global optimization technique by auxiliary function method in a directional search
inferred← citeshttps://doi.org/10.1023/a:1008224107486openalex-snapshot
Global Interval Methods for Local Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1023/a:1009990700281openalex-snapshot
Robust Autonomous Robot Localization Using Interval Analysis
inferred← citeshttps://doi.org/10.1023/a:1016246616462openalex-snapshot
Search Heuristics for Box Decomposition Methods
inferred← citeshttps://doi.org/10.1023/b:reom.0000032107.85627.45openalex-snapshot
Slope Intervals, Generalized Gradients, Semigradients, Slant Derivatives, and Csets
inferred← citeshttps://doi.org/10.1109/icsens.2003.1278890openalex-snapshot
Robot localisation using interval analysis
inferred← citeshttps://doi.org/10.1109/tim.2008.2005266openalex-snapshot
Robust Sensor-Based Navigation for Mobile Robots
inferred← citeshttps://doi.org/10.1162/pres.16.2.206openalex-snapshot
Interactive Continuous Collision Detection Using Swept Volume for Avatars
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09867openalex-snapshot
Certified Global Minima for a Benchmark of Difficult Optimization Problems
inferred← citeshttps://doi.org/10.70675/4013487dz95d0z48a5zb631z32979b89b189openalex-snapshot
Hybridation d’algorithmes évolutionnaires et de méthodes d’intervalles pour l’optimisation de problèmes difficiles
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.