Accelerated diagonal steepest descent method for unconstrained multiobjective optimization

DOI10.1007/S10957-020-01785-9MaRDI QIDQ2026727zbMATH OpenOpenAlexFDO

Authors Mustapha El Moudden, Abdelkrim El Mouatasim

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

diagonal steepest descent methodsmultiobjective optimizationNesterov stepPareto criticalunconstrained problems

Mathematics Subject Classification ID

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

Recommendations

• On the convergence of steepest descent methods for multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• Quasi-Newton's method for multiobjective optimization
• A new quasi-Newton's method for unconstrained multiobjective optimization
• Proximal gradient methods for multiobjective optimization and their applications

Cites work

• A steepest descent method for vector optimization
• Extended Newton methods for multiobjective optimization: majorizing function technique and convergence analysis
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 47208 (Why is no real title available?)
• Multicriteria optimization
• Newton's method for multiobjective optimization
• OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
• On the choice of parameters for the weighting method in vector optimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Quasi-Newton methods for solving multiobjective optimization
• Steepest descent methods for multicriteria optimization.
• Trade-off analysis approach for interactive nonlinear multiobjective optimization

Cited in

(15)

• Accelerated double direction method for solving unconstrained optimization problems
• 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
• Improved front steepest descent for multi-objective optimization
• Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-like Systems
• Fast convergence of inertial multiobjective gradient-like systems with asymptotic vanishing damping
• Convergence analysis of a generalized proximal algorithm for multiobjective quasiconvex minimization on Hadamard manifolds
• A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
• Improvements to steepest descent method for multi-objective optimization
• A three-term conjugate gradient-type method with sufficient descent property for vector optimization
• An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds
• Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
• An accelerated method for solving constrained multi-objective optimization

Describes a project that uses

Uses Software

• OLAF

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

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