A line search technique for a class of multi-objective optimization problems using subgradient
type: Item
instance of: scholarly article
title: A line search technique for a class of multi-objective optimization problems using subgradient
author: D. Kumar
author: Geetanjali Panda
published in: Positivity
publication date: 2024-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7873833
zbMATH Keywords: line search technique
zbMATH Keywords: convex optimization
zbMATH Keywords: Pareto optimal point
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: sub-gradient method
MaRDI profile type: Publication
cites work: Q5165470
cites work: Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
cites work: Comparative evaluation of some interactive reference point-based methods for multi-objective optimisation
cites work: Evolutionary Algorithms for Solving Multi-Objective Problems
cites work: Non-dominated Sorting Based Multi/Many-Objective Optimization: Two Decades of Research and Application
cites work: Steepest descent methods for multicriteria optimization.
cites work: A steepest descent method for vector optimization
cites work: On the convergence of the projected gradient method for vector optimization
cites work: A projected gradient method for vector optimization problems
cites work: Newton's Method for Multiobjective Optimization
cites work: Quasi-Newton methods for solving multiobjective optimization
cites work: On \(q\)-Newton's method for unconstrained multiobjective optimization problems
cites work: On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
cites work: Newton’s method for uncertain multiobjective optimization problems under finite uncertainty sets
cites work: A method for constrained multiobjective optimization based on SQP techniques
cites work: A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem
cites work: A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
cites work: Proximal gradient methods for multiobjective optimization and their applications
cites work: The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem
cites work: A subgradient method for multiobjective optimization
cites work: A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
cites work: Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
cites work: An efficient descent method for locally Lipschitz multiobjective optimization problems
DOI: 10.1007/S11117-024-01051-6
description: scientific article; zbMATH DE number 7873833