Convergence of the projected gradient method for quasiconvex multiobjective optimization

DOI10.1016/j.na.2011.04.067zbMath1225.90114OpenAlexW2085491742MaRDI QIDQ555040

Jianyong Qiao, Sumit K. Garg

Publication date: 22 July 2011

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2011.04.067

zbMATH Keywords

multiobjective optimizationPareto-optimalityArmijo-type searchprojected gradient methodsquasiconvex multiobjective functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (29)

An incremental descent method for multi-objective optimization ⋮ A proximal gradient splitting method for solving convex vector optimization problems ⋮ On inexact projected gradient methods for solving variable vector optimization problems ⋮ Convergence of inexact quasisubgradient methods with extrapolation ⋮ A steepest descent-like method for vector optimization problems with variable domination structure ⋮ A nonmonotone gradient method for constrained multiobjective optimization problems ⋮ A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application ⋮ A quasi-Newton method with Wolfe line searches for multiobjective optimization ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ An inexact steepest descent method for multicriteria optimization on Riemannian manifolds ⋮ Nonmonotone gradient methods for vector optimization with a portfolio optimization application ⋮ Multiobjective BFGS method for optimization on Riemannian manifolds ⋮ Multiobjective conjugate gradient methods on Riemannian manifolds ⋮ Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Unnamed Item ⋮ A steepest descent-like method for variable order vector optimization problems ⋮ A subgradient-like algorithm for solving vector convex inequalities ⋮ Proximal point algorithms for convex multi-criteria optimization with applications to supply chain risk management ⋮ The self regulation problem as an inexact steepest descent method for multicriteria optimization ⋮ A proximal point-type method for multicriteria optimization ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ A strongly convergent proximal point method for vector optimization ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ A sequential quadratic programming method for constrained multi-objective optimization problems ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ Newton-like methods for solving vector optimization problems ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization

Uses Software

• OLAF

Cites Work

• Unnamed Item
• Unnamed Item
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
• Convergence of a projected gradient method variant for quasiconvex objectives
• Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems
• Epsilon-dominating solutions in mean-variance portfolio analysis
• Optimality conditions for set-valued optimization problems
• Dominating sets for convex functions with some applications
• Steepest descent methods for multicriteria optimization.
• Convergence of the gradient projection method for generalized convex minimization
• A steepest descent method for vector optimization
• A projected gradient method for vector optimization problems
• An efficient sampling approach to multiobjective optimization
• On the choice of parameters for the weighting method in vector optimization
• Convergence of the steepest descent method for minimizing quasiconvex functions
• Scalarization in vector optimization
• Newton's Method for Multiobjective Optimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Full convergence of the steepest descent method with inexact line searches
• A characterization of quasiconvex vector-valued functions
• Proximal Methods in Vector Optimization
• OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility

This page was built for publication: Convergence of the projected gradient method for quasiconvex multiobjective optimization