On the public citation graph
Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
0 signed · 36 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.1002/nav.3800200316openalex-snapshot
Some experiments in global optimization
inferredcites →https://doi.org/10.1007/bf00933504openalex-snapshot
Global optimization by controlled random search
inferredcites →https://doi.org/10.1007/bf00934131openalex-snapshot
Outer approximation algorithm for nondifferentiable optimization problems
inferredcites →https://doi.org/10.1007/bf00938542openalex-snapshot
An algorithm for global optimization of Lipschitz continuous functions
inferredcites →https://doi.org/10.1007/bf01396702openalex-snapshot
Global optimization using interval analysis ? the multi-dimensional case
inferredcites →https://doi.org/10.1007/bf02238195openalex-snapshot
Extended univariate algorithms for n-dimensional global optimization
inferredcites →https://doi.org/10.1016/0025-5564(70)90087-8openalex-snapshot
A method of unconstrained global optimization
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/0378-4754(82)90117-3openalex-snapshot
Numerical optimization of computer models
inferredcites →https://doi.org/10.1057/jors.1982.238openalex-snapshot
Numerical Optimization of Computer Models
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0312365-xopenalex-snapshot
On Descent from Local Minima
inferredcites →https://doi.org/10.1137/0709036openalex-snapshot
A Sequential Method Seeking the Global Maximum of a Function
inferredcites →https://doi.org/10.1147/rd.165.0504openalex-snapshot
Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
inferredcites →https://doi.org/10.1287/opre.6.2.244openalex-snapshot
A Discussion of Random Methods for Seeking Maxima
inferredcites →https://doi.org/10.2307/3008352openalex-snapshot
Numerical Methods for Non-Linear Optimization
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-4614-9093-7_2openalex-snapshot
Lipschitz Optimization with Different Bounds over Simplices
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_764-1openalex-snapshot
Lipschitz Expensive Global Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-61007-8_4openalex-snapshot
A Brief Review of Non-convex Single-Objective Optimization
inferred← citeshttps://doi.org/10.1007/bf01580907openalex-snapshot
Convergence qualification of adaptive partition algorithms in global optimization
inferred← citeshttps://doi.org/10.1007/bfb0042226openalex-snapshot
A non-clustering multistart algorithm for global optimization
inferred← citeshttps://doi.org/10.1007/s10288-004-0038-6openalex-snapshot
Reformulation and convex relaxation techniques for global optimization
inferred← citeshttps://doi.org/10.1007/s10957-004-0948-7openalex-snapshot
Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms
inferred← citeshttps://doi.org/10.1007/s11590-009-0156-3openalex-snapshot
Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)51633-xopenalex-snapshot
A Hierarchical Neural Optimization Structure for Access Control and Resource Sharing in Integrated Communication Networks
inferred← citeshttps://doi.org/10.1023/a:1004613001755openalex-snapshot
Efficient Strategy for Adaptive Partition of N-Dimensional Intervals in the Framework of Diagonal Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008229430888openalex-snapshot
A Multivariate Global Optimization Using Linear Bounding Functions
inferred← citeshttps://doi.org/10.1023/a:1008290629896openalex-snapshot
A Global Optimization Algorithm for Multivariate Functions with Lipschitzian First Derivatives
inferred← citeshttps://doi.org/10.1023/a:1008719926680openalex-snapshot
Acceleration Tools for Diagonal Information Global Optimization Algorithms
inferred← citeshttps://doi.org/10.1080/02331930902945009openalex-snapshot
A global optimization approach for solving non-monotone variational inequality problems
inferred← citeshttps://doi.org/10.1080/10556788.2010.551537openalex-snapshot
Parallel branch and bound for global optimization with combination of Lipschitz bounds
inferred← citeshttps://doi.org/10.1137/0915002openalex-snapshot
Global Optimization Decomposition Methods for Bounded Parameter Minimax Risk Evaluation
inferred← citeshttps://doi.org/10.3934/naco.2012.2.69openalex-snapshot
Univariate geometric Lipschitz global optimization algorithms
inferred← citeshttps://doi.org/10.47749/t/unicamp.2012.894935openalex-snapshot
Otimização global determinística no espaço-imagem
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.