Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
type: Item
instance of: scholarly article
title: Accelerated diagonal steepest descent method for unconstrained multiobjective optimization
zbMATH Open document ID: 1468.90122
author: Mustapha El Moudden
author: Abdelkrim El Mouatasim
published in: Journal of Optimization Theory and Applications
publication date: 2021-05-20T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 7350185
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: diagonal steepest descent methods
zbMATH Keywords: Pareto critical
zbMATH Keywords: unconstrained problems
zbMATH Keywords: Nesterov step
describes a project that uses: OLAF
MaRDI profile type: Publication
full work available at URL: s10957-020-01785-9
OpenAlex ID: W3108038965
cites work: Q3998346
cites work: OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: On the choice of parameters for the weighting method in vector optimization
cites work: Newton's Method for Multiobjective Optimization
cites work: Trade-off analysis approach for interactive nonlinear multiobjective optimization
cites work: Multicriteria optimization
cites work: Steepest descent methods for multicriteria optimization.
cites work: A steepest descent method for vector optimization
cites work: Quasi-Newton methods for solving multiobjective optimization
cites work: Q3151174
cites work: Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
DOI: 10.1007/S10957-020-01785-9
description: scientific article; zbMATH DE number 7350185