Multistart method with estimation scheme for global satisfycing problems

DOI10.1007/BF01096735zbMath0780.90086OpenAlexW2032933505MaRDI QIDQ2366964

Limin He, Elijah Polak

Publication date: 15 August 1993

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01096735

zbMATH Keywords

global optimizationlinear convergencemultistart methodsatisfycing

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acceleration methods based on convergence tests
• Concurrent stochastic methods for global optimization
• Finite-termination schemes for solving semi-infinite satisfycing problems
• Factorization and lattice theorems for a bounded pricipal ideal domain
• Bayesian stopping rules for multistart global optimization methods
• A stochastic method for global optimization
• Effective diagonalization strategies for the solution of a class of optimal design problems
• A mathematical basis for satisficing decision making
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Sequential stopping rules for the multistart algorithm in global optimisation
• A statistical estimate of the structure of multi-extremal problems
• Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
• Cluster Analysis Using Seed Points and Density-Determined Hyperspheres as an Aid to Global Optimization
• On the rate of convergence of certain methods of centers

This page was built for publication: Multistart method with estimation scheme for global satisfycing problems