Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty
From MaRDI portal
Recommendations
Cites work
- An Accurate Probability-of-Failure Calculation Method
- An explanation of ordinal optimization: Soft computing for hard problems
- Asynchronous parallel pattern search for nonlinear optimization
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
- scientific article; zbMATH DE number 3812689 (Why is no real title available?)
- scientific article; zbMATH DE number 588414 (Why is no real title available?)
- Introduction to Stochastic Search and Optimization
- Lipschitzian optimization without the Lipschitz constant
- On the Convergence of Pattern Search Algorithms
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
Cited in
(5)- The equivalence between ordinal optimization in deterministic complex problems and in stochastic simulation problems
- About optimization problems with probabilistic uncertainty
- Probability simulation optimization approach using orthogonal genetic algorithm
- Optimization under uncertainty using the generalized inverse distribution function
- Universal alignment probability revisited
This page was built for publication: Demonstration of probabilistic ordinal optimization concepts for continuous-variable optimization under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q862513)
