The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems

DOI10.1007/978-3-319-44003-3_12MaRDI QIDQ2958246zbMATH OpenOpenAlexFDO

Authors Victor Adrián Sosa Hernández, Adriana Lara, Heike Trautmann, Günter Rudolph, Oliver Schütze

Publication date 1 February 2017

Published in Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-44003-3_12

zbMATH Keywords

continuation methoddescent methodevolutionary algorithmslocal searchparameter dependent multi-objective optimizationstochastic local search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Direct Multisearch for Multiobjective Optimization
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
• Enhanced directed search: a continuation method for mixed-integer multi-objective optimization problems
• The directed search method for multi-objective memetic algorithms
• An alternative hybrid search direction for unconstrained optimization
• A direct search method for smooth and nonsmooth unconstrained optimization
• A modified direction approach for proper efficiency of multiobjective optimization
• A mesh adaptive direct search algorithm for multiobjective optimization

Cites work

• A path following method for box-constrained multiobjective optimization with applications to goal programming problems
• A variational approach to define robustness for parametric multiobjective optimization problems
• Certified parallelotope continuation for one-manifolds
• Computation of robust Pareto points
• Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems
• scientific article; zbMATH DE number 1975088 (Why is no real title available?)
• Nonlinear multiobjective optimization
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

Cited in

(6)

• On the use of polynomial models in multiobjective directional direct search
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
• An adaptive direct multisearch method for black-box multi-objective optimization
• The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume
• Direct Multisearch for Multiobjective Optimization
• The directed search method for multi-objective memetic algorithms

This page was built for publication: The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958246)