On the public citation graph

Unconstrained and constrained global optimization of polynomial functions in one variable

https://doi.org/10.1007/bf00121303
0 signed · 49 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/bf00120664openalex-snapshot
On Timonov's algorithm for global optimization of univariate Lipschitz functions
inferredcites →https://doi.org/10.1007/bf00933139openalex-snapshot
Global optimization using interval analysis: The one-dimensional case
inferredcites →https://doi.org/10.1007/bf00939667openalex-snapshot
Primal-relaxed dual global optimization approach
inferredcites →https://doi.org/10.1007/bf01096414openalex-snapshot
New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
inferredcites →https://doi.org/10.1007/bf01581202openalex-snapshot
Global optimization of univariate Lipschitz functions: I. Survey and properties
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/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
inferredcites →https://doi.org/10.1016/0022-247x(85)90268-9openalex-snapshot
The cubic algorithm
inferredcites →https://doi.org/10.1016/0022-247x(87)90053-9openalex-snapshot
The beta-algorithm
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(72)90115-2openalex-snapshot
An algorithm for finding the absolute extremum of a function
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.1049/ep.1978.0470openalex-snapshot
From engineering to cybernetics
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.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.1137/1.9781611970906openalex-snapshot
Methods and Applications of Interval Analysis
inferredcites →https://doi.org/10.2307/2002959openalex-snapshot
Rounding Errors in Algebraic Processes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471787779.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/aic.690400511openalex-snapshot
Stability in optimal design: Synthesis of complex reactor networks
inferred← citeshttps://doi.org/10.1002/rnc.4590050803openalex-snapshot
Robust stability analysis of systems with real parametric uncertainty: A global optimization approach
inferred← citeshttps://doi.org/10.1007/978-1-4612-1960-6_7openalex-snapshot
Deterministic Global Optimization in Design, Control, and Computational Chemistry
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-2600-8_13openalex-snapshot
A Method Using Local Tuning for Minimizing Functions with Lipschitz Derivatives
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/bf00939667openalex-snapshot
Primal-relaxed dual global optimization approach
inferred← citeshttps://doi.org/10.1007/bf01096418openalex-snapshot
A remark on the GOP algorithm for global optimization
inferred← citeshttps://doi.org/10.1007/bf01096769openalex-snapshot
Convergence of the (GOP) algorithm for a large class of smooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf01099466openalex-snapshot
Simple global minimization algorithm for one-variable rational functions
inferred← citeshttps://doi.org/10.1007/bf02190006openalex-snapshot
Generalized primal-relaxed dual approach for global optimization
inferred← citeshttps://doi.org/10.1007/pl00011409openalex-snapshot
Global optimization of nonconvex factorable programming problems
inferred← citeshttps://doi.org/10.1007/s10898-010-9529-5openalex-snapshot
Partitioning procedure for polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10898-015-0292-5openalex-snapshot
Global optimality conditions and optimization methods for polynomial programming problems
inferred← citeshttps://doi.org/10.1007/s40305-017-0157-3openalex-snapshot
Optimization Methods for Box-Constrained Nonlinear Programming Problems Based on Linear Transformation and Lagrange Interpolating Polynomials
inferred← citeshttps://doi.org/10.1016/0098-1354(94)00106-5openalex-snapshot
Global optimization for the phase and chemical equilibrium problem: Application to the NRTL equation
inferred← citeshttps://doi.org/10.1016/j.amc.2015.04.040openalex-snapshot
Global optimality conditions and optimization methods for constrained polynomial programming problems
inferred← citeshttps://doi.org/10.1016/j.automatica.2012.08.014openalex-snapshot
Computation of polytopic invariants for polynomial dynamical systems using linear programming
inferred← citeshttps://doi.org/10.1016/s0098-1354(99)80231-2openalex-snapshot
Recent advances in global optimization for process synthesis, design and control: Enclosure of all solutions
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/s0959-1524(99)00019-0openalex-snapshot
Global optimization in design and control of chemical process systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)44924-xopenalex-snapshot
Global Optimization in Design and Control of Chemical Process Systems
inferred← citeshttps://doi.org/10.1023/a:1008237515535openalex-snapshot
Comparison of Two Reformulation-Linearization Technique Based Linear Programming Relaxations for Polynomial Programming Problems
inferred← citeshttps://doi.org/10.1023/b:jogo.0000042114.11969.bbopenalex-snapshot
Improving Interval Analysis Bounds by Translations
inferred← citeshttps://doi.org/10.1080/10556789408805556openalex-snapshot
On global optimization in R using interval arithmetic
inferred← citeshttps://doi.org/10.1184/r1/6466703openalex-snapshot
Algorithmic approaches to process synthesis : logic and global optimization
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.