A Broyden-based algorithm for multi-objective local-search optimization

DOI10.1016/J.INS.2022.02.017OpenAlexW4213238682MaRDI QIDQ6118649

Salvador Botello-Aceves, Arturo Hernández Aguirre, S. Ivvan Valdez

Publication date: 28 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.02.017

zbMATH Keywords

multi-objective optimizationlocal searchsearch directionstransformation tensorimprovement directions

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survey of multi-objective optimization methods for engineering
• Methods for multi-objective optimization: an analysis
• Steepest descent methods for multicriteria optimization.
• Gradient subspace approximation: a direct search method for memetic computing
• Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm
• Minimization of functions having Lipschitz continuous first partial derivatives
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• The directed search method for multi-objective memetic algorithms

This page was built for publication: A Broyden-based algorithm for multi-objective local-search optimization