On the public citation graph

Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions

https://doi.org/10.1007/bf01096413
0 signed · 30 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/bf00121301openalex-snapshot
Reduction of indefinite quadratic programs to bilinear programs
inferredcites →https://doi.org/10.1007/bf00939667openalex-snapshot
Primal-relaxed dual global optimization approach
inferredcites →https://doi.org/10.1007/bf02207774openalex-snapshot
Cord-slope form of Taylor's expansion in univariate global optimization
inferredcites →https://doi.org/10.1007/bf02242276openalex-snapshot
Computing the range of values of real functions with accuracy higher than second order
inferredcites →https://doi.org/10.1007/bf02243480openalex-snapshot
Bounding the slope of polynomial operators and some applications
inferredcites →https://doi.org/10.1016/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
inferredcites →https://doi.org/10.1016/0098-1354(90)80020-copenalex-snapshot
A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory
inferredcites →https://doi.org/10.1016/0098-1354(90)80021-3openalex-snapshot
A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—II. Application of theory and test problems
inferredcites →https://doi.org/10.1016/0377-2217(79)90240-6openalex-snapshot
Towards global optimization 2
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.1057/jors.1990.45openalex-snapshot
New Computer Methods for Global Optimization
inferredcites →https://doi.org/10.1080/00207168508803469openalex-snapshot
Globally minimizing polynomials without evaluating derivatives
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0312365-xopenalex-snapshot
On Descent from Local Minima
inferredcites →https://doi.org/10.1515/9781400862528openalex-snapshot
Recent Advances in Global Optimization
inferredcites →https://doi.org/10.1515/9781400862528.165openalex-snapshot
Global Optimization of Problems with Polynomial Functions in One Variable
inferredcites →https://doi.org/10.2307/2002959openalex-snapshot
Rounding Errors in Algebraic Processes
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/978-1-4757-5362-2_1openalex-snapshot
Tight Relaxations for Nonconvex Optimization Problems Using the Reformulation-Linearization/Convexification Technique (RLT)
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_20openalex-snapshot
An Adapted Branch and Bound Algorithm for Approximating Real Root of a Ploynomial
inferred← citeshttps://doi.org/10.1007/bf00138689openalex-snapshot
A branch-and-reduce approach to global optimization
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.04.027openalex-snapshot
A new two-level linear relaxed bound method for geometric programming problems
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00013-8openalex-snapshot
New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
inferred← citeshttps://doi.org/10.1016/s0764-4442(98)85020-9openalex-snapshot
Algorithme d'encadrement de l'optimum global d'une fonction différentiable
inferred← citeshttps://doi.org/10.1023/a:1008224107486openalex-snapshot
Global Interval Methods for Local Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1023/a:1008249414776openalex-snapshot
Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents
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.2298/yjor120620004lopenalex-snapshot
Computing real zeros of a polynomial by branch and bound and branch and reduce algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1703.07169openalex-snapshot
A Deterministic Global Optimization Method for Variational Inference
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.