Multiobjective search algorithm with subdivision technique

DOI10.1007/S10589-006-6450-4MaRDI QIDQ853882zbMATH OpenOpenAlexFDO

Authors Johannes Jahn

Publication date 17 November 2006

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-006-6450-4

zbMATH Keywords

global optimizationvector optimizationrandom search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26)

Recommendations

• A subgradient method for multiobjective optimization
• Subset simulation for multi-objective optimization
• A weighting subgradient algorithm for multiobjective optimization
• Splitting for multi-objective optimization
• scientific article; zbMATH DE number 3889307
• An interval algorithm for multi-objective optimization
• Multi-search optimization techniques
• A gradient-based search method for multi-objective optimization problems

Cites work

• scientific article; zbMATH DE number 1975075 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Evolutionary multi-criterion optimization. Second international conference, EMO 2003, Faro, Portugal, April 8--11, 2003. Proceedings
• Multi-objective optimization using evolutionary algorithms
• Multiobjective Optimization
• Multiobjective optimization: survey of methods and industrial applications
• On two generalizations of Pareto minimality
• Stochastic method for the solution of unconstrained vector optimization problems

Cited in

(17)

• Parallel Cell Mapping for Unconstrained Multi-Objective Optimization Problems
• GPU implementation of a multiobjective search algorithm
• Multi-objective optimal design of feedback controls for dynamical systems with hybrid simple cell mapping algorithm
• A New Predictor Corrector Variant for Unconstrained Bi-objective Optimization Problems
• A Hybrid Algorithm for the Simple Cell Mapping Method in Multi-objective Optimization
• Methods for Multiobjective Bilevel Optimization
• An image set-oriented method for the numerical treatment of bi-level multi-objective optimization problems
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
• A memetic variant of R-NSGA-II for reference point problems
• Tracing locally Pareto-optimal points by numerical integration
• First order rejection tests for multiple-objective optimization
• Generating equidistant representations in biobjective programming
• The gradient subspace approximation and its application to bi-objective optimization problems
• Multiobjective bilevel optimization
• New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
• Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques

This page was built for publication: Multiobjective search algorithm with subdivision technique

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