A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
type: Item
instance of: scholarly article
title: A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems
zbMATH Open document ID: 1482.90207
author: Xiaopeng Zhao
author: Markus A. Köbis
author: Yonghong Yao
author: Jen-Chih Yao
published in: Journal of Optimization Theory and Applications
publication date: 2021-08-18T00:00:00Z
review text: In the paper under review, the authors provide a projected subgradient algorithm for solving constrained nondifferentiable quasiconvex multiobjective optimization problems. Under certain assumptions, the convergence of the sequence generated by the algorithm to a Pareto efficient solution of the problem is established. Some numerical examples are also presented to illustrate the performance of the suggested algorithm.
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7383049
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: Pareto optimality
zbMATH Keywords: quasiconvex functions
zbMATH Keywords: projected subgradient method
zbMATH Keywords: quasi-Fejér convergence
reviewed by: Tien Son Pham
describes a project that uses: OLAF
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10957-021-01872-5
OpenAlex ID: W3167336199
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: A Subgradient Method for Vector Optimization Problems
cites work: Convergence of the projected gradient method for quasiconvex multiobjective optimization
cites work: The self regulation problem as an inexact steepest descent method for multicriteria optimization
cites work: A weighting subgradient algorithm for multiobjective optimization
cites work: A relaxed projection method for solving multiobjective optimization problems
cites work: Full convergence of the steepest descent method with inexact line searches
cites work: Approximate proximal methods in vector optimization
cites work: A subgradient method for multiobjective optimization
cites work: An appropriate subdifferential for quasiconvex functions
cites work: New Farkas-type results for vector-valued functions: a non-abstract approach
cites work: Q3998346
cites work: OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
cites work: Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
cites work: An efficient sampling approach to multiobjective 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: Quasiconvex optimization and location theory
cites work: On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming
cites work: Q5165118
cites work: On the existence of Pareto solutions for polynomial vector optimization problems
cites work: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
cites work: Nonlinear multiobjective optimization
cites work: A linear scalarization proximal point method for quasiconvex multiobjective minimization
cites work: An inexact scalarization proximal point method for multiobjective quasiconvex minimization
cites work: Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
cites work: Lower subdifferentiable functions and their minimization by cutting planes
cites work: On the Minimization of Completion Time Variance with a Bicriteria Extension
cites work: Convex Analysis
cites work: A Trust-Region Algorithm for Heterogeneous Multiobjective Optimization
cites work: Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
cites work: Epsilon-dominating solutions in mean-variance portfolio analysis
cites work: Strict lower subdifferentiability and applications
cites work: On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
cites work: On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
cites work: Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
cites work: Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
DOI: 10.1007/S10957-021-01872-5
description: scientific article; zbMATH DE number 7383049