Global optimization on convex sets
From MaRDI portal
This clearly written paper shows that a general class of global optimization procedures, operating on intervals in \({\mathbb{R}}^ n\), can be applied also on compact convex sets with a nonempty interior: for this only an appropriate Lipschitzian extension of the objective function to an imbedding interval is necessary. Applications are indicated to linearly constrained problems and also to nonlinearly constrained problems. For computational aspects see another paper of the author [Computing 36, 91-103 (1986; Zbl 0572.65047)].
Recommendations
Cites work
- A stochastic method for global optimization
- Axiomatic approach to statistical models and their use in multimodal optimization theory
- Convergence properties of stochastic optimization procedures
- Extended univariate algorithms for n-dimensional global optimization
- Globally convergent methods for n-dimensional multiextremal optimization
- scientific article; zbMATH DE number 3756253 (Why is no real title available?)
- Non-Linear Programming Via Penalty Functions
- On statistical control of optimization
- On the global minimization of concave functions
- Sequential stopping rules for the multistart algorithm in global optimisation
- The Supporting Hyperplane Method for Unimodal Programming
Cited in
(26)- An implicit space covering method with applications to fixed point and global optimization problems
- Convergence qualification of adaptive partition algorithms in global optimization
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Global optimization conditions for certain nonconvex minimization problems
- Dominating sets for convex functions with some applications
- Global optimization in Hilbert space
- A geometric approach to global optimization
- New LP bound in multivariate Lipschitz optimization: Theory and applications
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities
- Convexity and montonicity in global optimization.
- scientific article; zbMATH DE number 3858873 (Why is no real title available?)
- On the convergence of adaptive partition algorithms in global optimization
- On volumes of bounded convex sets
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Optimization of Globally Convex Functions
- scientific article; zbMATH DE number 1064834 (Why is no real title available?)
- scientific article; zbMATH DE number 3993310 (Why is no real title available?)
- Global stability of interval optimization problems
- Global optimization in metric spaces with partial orders
- scientific article; zbMATH DE number 4185412 (Why is no real title available?)
- Solving nonlinear equation systems via global partition and search: Some experimental results
- Convexity and global optimization: A theoretical link
- A practical approach to quasi-convex optimization
- Set partition by globally optimized cluster seed points
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem
- Globally optimized calibration of environmental models
This page was built for publication: Global optimization on convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089268)