The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous

DOI10.1016/j.orl.2018.05.008OpenAlexW2805071669MaRDI QIDQ2417182

Benar Fux Svaiter

Publication date: 11 June 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2018.05.008

zbMATH Keywords

multiobjective optimizationHölder continuityPareto optimalityLipschitz continuitysteepest descent direction

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ An accelerated proximal gradient method for multiobjective optimization ⋮ Globally convergent Newton-type methods for multiobjective optimization

Cites Work

• Quasi-Newton methods for solving multiobjective optimization
• Multicriteria optimization with a multiobjective golden section line search
• Steepest descent methods for multicriteria optimization.
• A projected gradient method for vector optimization problems
• Quasi-Newton's method for multiobjective optimization
• Nonsmooth multiobjective programming with quasi-Newton methods
• Inexact projected gradient method for vector optimization
• A Method for Constrained Multiobjective Optimization Based on SQP Techniques
• Trust region methods for solving multiobjective optimisation
• On the convergence of the projected gradient method for vector optimization
• A modified Quasi-Newton method for vector optimization problem
• Newton's Method for Multiobjective Optimization
• Algorithms for multicriterion optimization
• Proximal Methods in Vector Optimization

This page was built for publication: The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous