Multiobjective Interacting Particle Algorithm for Global Optimization
From MaRDI portal
Publication:2940537
DOI10.1287/ijoc.2013.0580zbMath1304.90189MaRDI QIDQ2940537
Huseyin Onur Mete, Zelda B. Zabinsky
Publication date: 27 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0580
global optimization; simulated annealing; multiobjective optimization; Pareto optimality; efficient frontier; population-based algorithms; Markov chain Monte Carlo sampling; random search algorithms; Pattern Hit-and-Run
90C26: Nonconvex programming, global optimization
90C29: Multi-objective and goal programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Single Observation Adaptive Search for Continuous Simulation Optimization, Domination Measure: A New Metric for Solving Multiobjective Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Pattern hit-and-run for sampling efficiently on polytopes
- Meta-control of an interacting-particle algorithm for global optimization
- Pattern discrete and mixed hit-and-run for global optimization
- The interacting-particle algorithm with dynamic heating and cooling
- Heuristics for cardinality constrained portfolio optimization
- Hit-and-run mixes fast
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- On Finding the Maxima of a Set of Vectors
- On the Convergence and Applications of Generalized Simulated Annealing
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Hit-and-Run from a Corner
- Evolutionary Multi-Criterion Optimization
