A cover partitioning method for bound constrained global optimization

DOI10.1080/10556788.2011.557726MaRDI QIDQ2905347zbMATH OpenOpenAlexWikidataFDO

Authors C. J. Price, M. Reale, B. L. Robertson

Publication date 27 August 2012

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2011.557726

zbMATH Keywords

cover partitioning methodglobal optimizationstochastic algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• One side cut accelerated random search
• A stochastic algorithm for constrained global optimization
• A CARTopt method for bound-constrained global optimization
• Global optimization by multilevel coordinate search
• Global optimization

Cites work

• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• Adaptive partitioned random search to global optimization
• Analysis of Generalized Pattern Searches
• Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
• Convergence qualification of adaptive partition algorithms in global optimization
• Global minimization using an augmented Lagrangian method with variable lower-level constraints
• Global optimization
• Global optimization by continuous grasp
• Lipschitzian optimization without the Lipschitz constant
• On Accelerated Random Search
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• Semi-Infinite Programming: Theory, Methods, and Applications
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Testing Unconstrained Optimization Software

Cited in

(14)

• A stochastic algorithm for constrained global optimization
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization
• One side cut accelerated random search
• The robust constant and its applications in random global search for unconstrained global optimization
• Stochastic filter methods for generally constrained global optimization
• A CARTopt method for bound-constrained global optimization
• Global optimization using the DIRECT algorithm in Matlab
• Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
• Global optimization of expensive black box problems with a known lower bound
• CARTopt: a random search method for nonsmooth unconstrained optimization
• Global optimization by multilevel partition
• scientific article; zbMATH DE number 6183018 (Why is no real title available?)
• Using estimated gradients in bound-constrained global optimization
• An optimal algorithm for global optimization and adaptive covering

Describes a project that uses

Uses Software

• minpack
• alphaBB

This page was built for publication: A cover partitioning method for bound constrained global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2905347)