Accelerated diagonal steepest descent method for unconstrained multiobjective optimization

DOI10.1007/s10957-020-01785-9zbMath1468.90122OpenAlexW3108038965MaRDI QIDQ2026727

Abdelkrim El Mouatasim, Mustapha El Moudden

Publication date: 20 May 2021

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

Full work available at URL: https://doi.org/10.1007/s10957-020-01785-9

zbMATH Keywords

multiobjective optimizationPareto criticalunconstrained problemsdiagonal steepest descent methodsNesterov step

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (4)

An incremental descent method for multi-objective optimization ⋮ Variable metric method for unconstrained multiobjective optimization problems ⋮ An accelerated proximal gradient method for multiobjective optimization ⋮ Spectral conjugate gradient methods for vector optimization problems

Uses Software

• OLAF

Cites Work

• Unnamed Item
• Unnamed Item
• Quasi-Newton methods for solving multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• Multicriteria optimization
• A steepest descent method for vector optimization
• Trade-off analysis approach for interactive nonlinear multiobjective optimization
• On the choice of parameters for the weighting method in vector optimization
• Newton's Method for Multiobjective Optimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
• OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility

This page was built for publication: Accelerated diagonal steepest descent method for unconstrained multiobjective optimization