Explanation of goal softening in ordinal optimization
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 44 (1) , 94-99
- https://doi.org/10.1109/9.739080
Abstract
The authors explain the role of goal softening in the convergence of alignment probability employed in ordinal optimization. Using the order statistics formulation, they examine the exponential decrease of misalignment probability bounds when two or more designs are compared. Their conclusion states that, by relaxing the good enough subset and selected subset criteria, it is exponentially efficient in terms of matching good designs in a selected group.Keywords
This publication has 10 references indexed in Scilit:
- Stochastic comparison algorithm for discrete optimization with estimationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Ordinal optimization by means of standard clock simulation and crude analytical modelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Rates of Convergence of Ordinal Comparison for Dependent Discrete Event Dynamic SystemsJournal of Optimization Theory and Applications, 1997
- Universal Alignment Probabilities and Subset Selection for Ordinal OptimizationJournal of Optimization Theory and Applications, 1997
- Dynamics and convergence rate of ordinal comparison of stochastic discrete-event systemsIEEE Transactions on Automatic Control, 1997
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systemsJournal of Optimization Theory and Applications, 1996
- Ordinal optimization approach to rare event probability problemsDiscrete Event Dynamic Systems, 1995
- Heuristics, rules of thumb, and the 80/20 propositionIEEE Transactions on Automatic Control, 1994
- Ordinal optimization of DEDSDiscrete Event Dynamic Systems, 1992
- Stochastic Approximation Methods for Constrained and Unconstrained SystemsPublished by Springer Nature ,1978