Multiple-gradient Descent Algorithm for Pareto-Front Identification

DOI10.1007/978-94-017-9054-3_3zbMATH Open1320.65093OpenAlexW407273095MaRDI QIDQ5259697FDOQ5259697

Jean-Antoine Désidéri

Publication date: 29 June 2015

Published in: Computational Methods in Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-94-017-9054-3_3

zbMATH Keywords

convex hullmulti-objective optimizationdescent directionGram-Schmidt orthogonalization processBFGS quasi-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonlinear multiobjective optimization
• Multi-objective optimization using evolutionary algorithms
• The normalized normal constraint method for generating the Pareto frontier
• Steepest descent methods for multicriteria optimization.
• A steepest descent method for vector optimization
• PAINT: Pareto front interpolation for nonlinear multiobjective optimization
• Constructing a Pareto front approximation for decision making
• Comparison Between Two Multi-Objective Optimization Algorithms: PAES and MGDA. Testing MGDA on Kriging Metamodels
• Multiple-gradient descent algorithm (MGDA) for multiobjective optimization
• Cooperation and competition in multidisciplinary optimization

Cited In (4)

• The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning
• Parametric Optimization of Pulsating Jets in Unsteady Flow by Multiple-Gradient Descent Algorithm (MGDA)
• Convergence rates of the stochastic alternating algorithm for bi-objective optimization
• A stochastic multiple gradient descent algorithm

This page was built for publication: Multiple-gradient Descent Algorithm for Pareto-Front Identification

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