On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization
From MaRDI portal
Publication:328457
DOI10.1007/s10957-016-0977-zzbMath1353.65056OpenAlexW2490800486MaRDI QIDQ328457
Publication date: 20 October 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-0977-z
global optimizationconvergencemulti-objective optimizationconstrained optimizationevolutionary algorithmstochastic searchadaptive stochastic algorithms
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Stochastic programming (90C15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Convergence of a random optimization method for constrained optimization problems
- Global optimization by controlled random search
- Global optimization requires global information
- Nonlinear multiobjective optimization
- Stochastic adaptive search for global optimization.
- On the convergence of a population-based global optimization algorithm
- On the convergence of multiobjective evolutionary algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Proper efficiency and the theory of vector maximization
- Convergence properties of stochastic optimization procedures
- Interactive multi-objective programming technique using random optimization method
- Minimization by Random Search Techniques
- Introduction to Stochastic Search and Optimization
- Nonlinear Programming
- A Class of Solutions for Group Decision Problems
