On the public citation graph

Minimization of multiextremal functions under nonconvex constraints

https://doi.org/10.1007/bf01075079
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/bf00967189openalex-snapshot
Mathematical methods of operations research
inferredcites →https://doi.org/10.1007/bf01069306openalex-snapshot
Algorithm for finding the value of the global extremum of a function of several variables with a given accuracy
inferredcites →https://doi.org/10.2307/1909808openalex-snapshot
Optimum Seeking Methods

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_182openalex-snapshot
Global Optimization Using Space Filling
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-36721-7_8openalex-snapshot
Univariate Algorithms for Solving Global Optimization Problems with Multiextremal Non-differentiable Constraints
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_5openalex-snapshot
A Brief Conclusion
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_9openalex-snapshot
Lipschitz Optimization
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-78759-2_20openalex-snapshot
Parametric Randomization for Accelerating the Nested Global 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-46631-1_13openalex-snapshot
Effective Algoritm for Global Optimization with Parallel Computations
inferred← citeshttps://doi.org/10.1007/bf00122428openalex-snapshot
Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves
inferred← citeshttps://doi.org/10.1007/bf01099650openalex-snapshot
An algorithm for solving global optimization problems with nonlinear constraints
inferred← citeshttps://doi.org/10.1007/s10589-005-3906-xopenalex-snapshot
Univariate Global Optimization with Multiextremal Non-Differentiable Constraints Without Penalty Functions
inferred← citeshttps://doi.org/10.1007/s11590-006-0015-4openalex-snapshot
A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
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.ijfatigue.2022.107490openalex-snapshot
A framework for automating the parameter determination of crack growth models
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)36233-xopenalex-snapshot
A Constrained Global Optimization Algorithm with Application to PI Robust Synthesis
inferred← citeshttps://doi.org/10.1023/a:1012391611462openalex-snapshot
Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
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.1063/5.0210164openalex-snapshot
On numerical methods for black-box constrained global optimization
inferred← citeshttps://doi.org/10.2316/journal.201.2006.3.201-1558openalex-snapshot
MAXIMIZING PERFORMANCE AND ROBUSTNESS OF PI AND PID CONTROLLERS BY GLOBAL OPTIMIZATION
inferred← citeshttps://doi.org/10.2514/2.4616openalex-snapshot
Direct Method for Rapid Prototyping of Near-Optimal Aircraft Trajectories
inferred← citeshttps://doi.org/10.2514/6.1998-4342openalex-snapshot
Modification of direct method for flight route and profile at presence of prohibited zones optimization
inferred← citeshttps://doi.org/10.3934/naco.2012.2.69openalex-snapshot
Univariate geometric Lipschitz global optimization algorithms
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.