\textsc{Oscars}-II: an algorithm for bound constrained global optimization
type: Item
instance of: scholarly article
title: \textsc{Oscars}-II: an algorithm for bound constrained global optimization
zbMATH Open document ID: 1465.90078
author: Yanyan Li
published in: Journal of Global Optimization
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7340735
zbMATH Keywords: direct search
zbMATH Keywords: numerical results
zbMATH Keywords: accelerated random search
zbMATH Keywords: power law test
describes a project that uses: minpack
describes a project that uses: MSO
MaRDI profile type: Publication
full work available at URL: s10898-020-00928-6
OpenAlex ID: W3047800233
cites work: MSO: a framework for bound-constrained black-box global optimization algorithms
cites work: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
cites work: On Accelerated Random Search
cites work: Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
cites work: Best practices for comparing optimization algorithms
cites work: On convergence rate of a rectangular partition based global optimization algorithm
cites work: The GLOBAL optimization method revisited
cites work: Stopping Rules for a Random Optimization Method
cites work: A review of recent advances in global optimization
cites work: Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
cites work: Speeding up continuous GRASP
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Global Continuous Optimization with Error Bound and Fast Convergence
cites work: Global optimization by multilevel partition
cites work: A partition-based global optimization algorithm
cites work: Global optimization based on local searches
cites work: Testing Unconstrained Optimization Software
cites work: Performance of global random search algorithms for large dimensions
cites work: Convergence qualification of adaptive partition algorithms in global optimization
cites work: A cover partitioning method for bound constrained global optimization
cites work: A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
cites work: One side cut accelerated random search
cites work: Stochastic filter methods for generally constrained global optimization
cites work: Pure Random Search with exponential rate of convergency
cites work: Constrained global optimization of expensive black box functions using radial basis functions
cites work: A wide class of test functions for global optimization
cites work: Adaptive partitioned random search to global optimization
cites work: Global optimization
cites work: Stochastic global optimization.
DOI: 10.1007/S10898-020-00928-6
Recommended article: ICOS: a branch and bound based solver for rigorous global optimization
Recommended article: A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION
Recommended article: Q5462764
Recommended article: Q4855843
Recommended article: An interval algorithm for constrained global optimization
Recommended article: Constrained global optimization: algorithms and applications
Recommended article: Q3500515
Recommended article: A globally convergent algorithm for nonlinearly constrained optimization problems
Recommended article: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
Recommended article: MSO: a framework for bound-constrained black-box global optimization algorithms
description: scientific article; zbMATH DE number 7340735