scientific article

zbMath0309.90052MaRDI QIDQ4068464

J. Gomulka, L. C. W. Dixon, Giorgio Szegö

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Search theory (90B40) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A class of filled functions for finding global minimizers of a function of several variables, Improving hit-and-run for global optimization, A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems, Globally convergent methods for n-dimensional multiextremal optimization, Verified solution of large systems and global optimization problems, The convergence speed of interval methods for global optimization, Test problem generator for unconstrained global optimization, A branch-and-bound algorithm for bound constrained optimization problems without derivatives, Integral global minimization: Algorithms, implementations and numerical tests, A branch-and-reduce approach to global optimization, Derivative-free methods for bound constrained mixed-integer optimization, Computer programs for non‐linear programming, Global optimization using interval analysis - the multi-dimensional case, (Global) optimization: historical notes and recent developments, Simple transformation functions for finding better minima, Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents, Stochastic global optimization methods part I: Clustering methods, Further remarks on the global Newton method, Benchmarking nonlinear optimization software in technical computing environments, Multicriterion optimization using interval analysis, Qualitative and quantitative experiment design for phenomenological models - a survey, A partition-based global optimization algorithm, LP-form inclusion functions for global optimization, Universal Prediction Distribution for Surrogate Models, Pure adaptive search in global optimization, Unconstrained and constrained global optimization of polynomial functions in one variable, Constructing test functions for global optimization using continuous formulations of graph problems, Convergence qualification of adaptive partition algorithms in global optimization, A parallel algorithm for semi-infinite programming, On when to stop sampling for the maximum, A numerical study of basins of attraction of zero-finding neural nets designed using control theory, Constraint reasoning based on interval arithmetic: The tolerance propagation approach, Bayesian stopping rules for multistart global optimization methods, A stochastic method for global optimization, A critical review of discrete filled function methods in solving nonlinear discrete optimization problems, A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice, Solving nonlinear equation systems via global partition and search: Some experimental results, Clustering methods for large scale geometrical global optimization, A differential equation approach to nonlinear programming, A deterministic algorithm for global optimization, Set inversion via interval analysis for nonlinear bounded-error estimation, Identification of region of attraction for global optimization problem using interval symmetric operator, An effective linear approximation method for separable programming problems, Solving systems of polynomial equations by bounded and real homotopy, A computable filled function used for global minimization, Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions, Set partition by globally optimized cluster seed points, On the investigation of stochastic global optimization algorithms