A new reduced gradient method for solving linearly constrained multiobjective optimization problems

DOI10.1007/s10589-018-0023-1zbMath1412.90134OpenAlexW2883704858WikidataQ129489787 ScholiaQ129489787MaRDI QIDQ1756580

Ahmed El Ghali, Mustapha El Moudden

Publication date: 21 December 2018

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

Full work available at URL: https://doi.org/10.1007/s10589-018-0023-1

zbMATH Keywords

multiobjective optimizationlinear constraintsPareto critical pointbisection algorithmreduced gradient methods

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Methods of reduced gradient type (90C52)

Related Items (2)

A concave optimization-based approach for sparse multiobjective programming ⋮ An augmented Lagrangian algorithm for multi-objective optimization

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Steepest descent methods for multicriteria optimization.
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Multiple reduced gradient method for multiobjective optimization problems
• A projected gradient method for vector optimization problems
• Trade-off analysis approach for interactive nonlinear multiobjective optimization
• Linear and nonlinear programming
• Explicit gradient information in multiobjective optimization
• Newton's Method for Multiobjective Optimization
• An Existence Theorem in Vector Optimization
• Multicriteria Optimization

This page was built for publication: A new reduced gradient method for solving linearly constrained multiobjective optimization problems