A soft approach for hard continuous optimization
From MaRDI portal
Recommendations
Cites work
- An approach to nonlinear programming
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Explanation of goal softening in ordinal optimization
- Generating random vectors uniformly distributed inside and on the surface of different regions
- Handbook of global optimization
- Hit-and-run algorithms for the identification of nonredundant linear inequalities
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- Introduction to global optimization
- Recent developments and trends in global optimization
- Universal alignment probabilities and subset selection for ordinal optimization
Cited in
(3)
This page was built for publication: A soft approach for hard continuous optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491765)