Global optimization on convex sets

DOI10.1007/BF01721128zbMath0618.90085MaRDI QIDQ1089268

B. George

Publication date: 1986

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

multiextremal optimizationcompact convex setsglobal optimization proceduresLipschitzian extension

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (10)

Global optimization conditions for certain nonconvex minimization problems ⋮ New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ On the convergence of adaptive partition algorithms in global optimization ⋮ Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure ⋮ Globally optimized calibration of environmental models ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Global optimization of univariate Lipschitz functions. I: Survey and properties ⋮ Solving nonlinear equation systems via global partition and search: Some experimental results ⋮ A decomposition method for MINLPs with Lipschitz continuous nonlinearities ⋮ Set partition by globally optimized cluster seed points

Cites Work

• Unnamed Item
• On the global minimization of concave functions
• Extended univariate algorithms for \(n\)-dimensional global optimization
• A stochastic method for global optimization
• On statistical control of optimization
• Convergence properties of stochastic optimization procedures
• Globally convergent methods for n-dimensional multiextremal optimization
• Sequential stopping rules for the multistart algorithm in global optimisation
• Axiomatic approach to statistical models and their use in multimodal optimization theory
• The Supporting Hyperplane Method for Unimodal Programming
• Non-Linear Programming Via Penalty Functions

This page was built for publication: Global optimization on convex sets