On the public citation graph

Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves

0 signed · 70 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.1002/1520-6750(199008)37:4<433::aid-nav3220370403>3.0.co;2-2openalex-snapshot
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
inferredcites →https://doi.org/10.1007/978-1-4612-5022-7openalex-snapshot
Numerical Optimization Techniques
inferredcites →https://doi.org/10.1007/978-3-662-12603-5_25openalex-snapshot
Numerical Methods for Multiextremal Nonlinear Programming Problems with Nonconvex Constraints
inferredcites →https://doi.org/10.1007/bf00120661openalex-snapshot
Bayesian methods in global optimization
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/bf01075079openalex-snapshot
Minimization of multiextremal functions under nonconvex constraints
inferredcites →https://doi.org/10.1007/bfb0008366openalex-snapshot
Multilevel dichotomy algorithm in global optimization
inferredcites →https://doi.org/10.1016/0041-5553(72)90064-xopenalex-snapshot
Best sequential search strategies for finding an extremum
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/0041-5553(87)90115-7openalex-snapshot
A method for solving multi-extremal problems with non-convex constraints, that uses a priori information about estimates of the optimum
inferredcites →https://doi.org/10.1016/0041-5553(89)90002-5openalex-snapshot
A global minimization algorithm with parallel iterations
inferredcites →https://doi.org/10.1016/s0019-9958(68)90367-7openalex-snapshot
Space filling curves and mathematical programming
inferredcites →https://doi.org/10.1016/s0927-0507(89)01010-8openalex-snapshot
Chapter IX Global optimization
inferredcites →https://doi.org/10.1049/ep.1978.0470openalex-snapshot
From engineering to cybernetics
inferredcites →https://doi.org/10.1057/jors.1951.16openalex-snapshot
Methods of Operations Research
inferredcites →https://doi.org/10.1080/02331938808843322openalex-snapshot
Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
inferredcites →https://doi.org/10.1080/17442508908833568openalex-snapshot
The information approach to multiextremal optimization problems
inferredcites →https://doi.org/10.1109/t-c.1971.223258openalex-snapshot
Alternative Algorithm for Hilbert's Space-Filling Curve
inferredcites →https://doi.org/10.1525/9780520411586-036openalex-snapshot
Nonlinear Programming

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/0-306-48332-7_180openalex-snapshot
Global Optimization Methods for Systems of Nonlinear Equations
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_182openalex-snapshot
Global Optimization Using Space Filling
inferred← citeshttps://doi.org/10.1007/0-387-30528-9openalex-snapshot
Global optimization : from theory to implementation
inferred← citeshttps://doi.org/10.1007/0-387-30528-9_13openalex-snapshot
Global Order-Value Optimization by means of a Multistart Harmonic Oscillator Tunneling Strategy
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_241openalex-snapshot
Global Optimization Methods for Systems of Nonlinear Equations
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_248openalex-snapshot
Global Optimization Using Space Filling
inferred← citeshttps://doi.org/10.1007/978-1-4614-8042-6_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-8042-6_2openalex-snapshot
Approximations to Peano Curves: Algorithms and Software
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-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_9openalex-snapshot
Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-05807-4_5openalex-snapshot
Comparison of Dimensionality Reduction Schemes for Parallel Global Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-24494-1_2openalex-snapshot
From Global Optimization to Optimal Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_241-1openalex-snapshot
Global Optimization Methods for Systems of Nonlinear Equations
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_248-1openalex-snapshot
Global Optimization Using Space Filling
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-030-64616-5_13openalex-snapshot
Adaptive Global Optimization Using Graphics Accelerators
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/978-3-540-45145-7_7openalex-snapshot
Parallel Computing for Globally Optimal Decision Making
inferred← citeshttps://doi.org/10.1007/978-3-642-39958-9_14openalex-snapshot
SVM Regression Parameters Optimization Using Parallel Global Search Algorithm
inferred← citeshttps://doi.org/10.1007/bf01099650openalex-snapshot
An algorithm for solving global optimization problems with nonlinear constraints
inferred← citeshttps://doi.org/10.1007/bf01128945openalex-snapshot
Reduction of multi-extremum multi-criterion problems with constraints to unconstrained optimization problems: Theory and algorithms
inferred← citeshttps://doi.org/10.1007/bf02096402openalex-snapshot
An adaptive stochastic global optimization algorithm for one-dimensional functions
inferred← citeshttps://doi.org/10.1007/bf02192085openalex-snapshot
New LP bound in multivariate Lipschitz optimization: Theory and applications
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/s10898-009-9508-xopenalex-snapshot
An information global minimization algorithm using the local improvement technique
inferred← citeshttps://doi.org/10.1007/s10898-010-9525-9openalex-snapshot
A genetic algorithm for a global optimization problem arising in the detection of gravitational waves
inferred← citeshttps://doi.org/10.1007/s10898-017-0598-6openalex-snapshot
On tightness and anchoring of McCormick and other relaxations
inferred← citeshttps://doi.org/10.1007/s10898-025-01555-9openalex-snapshot
An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
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.1007/s40305-020-00294-wopenalex-snapshot
Novel Global Optimization Algorithm with a Space-Filling Curve and Integral Function
inferred← citeshttps://doi.org/10.1016/j.apnum.2009.10.004openalex-snapshot
Lipschitz and Hölder global optimization using space-filling curves
inferred← citeshttps://doi.org/10.1016/j.cor.2014.06.019openalex-snapshot
Test problem generator for unconstrained global optimization
inferred← citeshttps://doi.org/10.1016/j.future.2004.05.007openalex-snapshot
Parallel computing for globally optimal decision making on cluster systems
inferred← citeshttps://doi.org/10.1016/j.procs.2018.08.246openalex-snapshot
Comparison of dimensionality reduction schemes for derivative-free global optimization algorithms
inferred← citeshttps://doi.org/10.1023/a:1008294716304openalex-snapshot
Bayesian Algorithms for One-Dimensional Global Optimization
inferred← citeshttps://doi.org/10.1023/a:1008372702319openalex-snapshot
Parallel Information Algorithm with Local Tuning for Solving Multidimensional GO Problems
inferred← citeshttps://doi.org/10.1023/a:1008719926680openalex-snapshot
Acceleration Tools for Diagonal Information Global Optimization Algorithms
inferred← citeshttps://doi.org/10.1023/a:1010185125012openalex-snapshot
Parallel Asynchronous Global Search and the Nested Optimization Scheme
inferred← citeshttps://doi.org/10.1063/1.4952196openalex-snapshot
Space-filling curves and multiple estimates of Hölder constants in derivative-free global optimization
inferred← citeshttps://doi.org/10.1063/1.4965336openalex-snapshot
New approach to parallel solving a set of global optimization problems
inferred← citeshttps://doi.org/10.1080/10556789408805559openalex-snapshot
Sequential and parallel algorithms for global optimization
inferred← citeshttps://doi.org/10.1109/clusterwksp.2010.5613103openalex-snapshot
Investigation of selection strategies in parallel branch and bound algorithm with simplicial partitions
inferred← citeshttps://doi.org/10.1134/s1995080218040133openalex-snapshot
Generalized Parallel Computational Schemes for Time-Consuming Global Optimization
inferred← citeshttps://doi.org/10.1137/0805041openalex-snapshot
An Information Global Optimization Algorithm with Local Tuning
inferred← citeshttps://doi.org/10.12737/16074openalex-snapshot
Experimental study on solution possibilities of multiextremal optimization problems through heuristic methods
inferred← citeshttps://doi.org/10.17535/crorr.2019.0024openalex-snapshot
Generating $\alpha $-dense curves in non-convex sets to solve a class of non-smooth constrained global optimization
inferred← citeshttps://doi.org/10.33993/jnaat542-1601openalex-snapshot
Efficient global optimization of multivariate functions with unknown H\"{o}lder constants via \(\alpha\)-dense curves
inferred← citeshttps://doi.org/10.3846/1392-8619.2009.15.310-325openalex-snapshot
GLOBAL OPTIMIZATION USING THE BRANCH‐AND‐BOUND ALGORITHM WITH A COMBINATION OF LIPSCHITZ BOUNDS OVER SIMPLICES
inferred← citeshttps://doi.org/10.47749/t/unicamp.2005.334739openalex-snapshot
Otimização global usando trajetorias densas e aplicações
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.