A Subgradient Method for Vector Optimization Problems
From MaRDI portal
Publication:5408215
DOI10.1137/120866415zbMath1295.90065OpenAlexW2081313036MaRDI QIDQ5408215
Publication date: 9 April 2014
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120866415
Related Items (27)
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ A proximal gradient splitting method for solving convex vector optimization problems ⋮ Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ Subgradient algorithms for solving variable inequalities ⋮ On inexact projected gradient methods for solving variable vector optimization problems ⋮ A study of Liu-Storey conjugate gradient methods for vector optimization ⋮ A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application ⋮ Spectral conjugate gradient methods for vector optimization problems ⋮ On the extension of the Hager-Zhang conjugate gradient method for vector optimization ⋮ Convergence rates of the stochastic alternating algorithm for bi-objective optimization ⋮ Conditional gradient method for vector optimization ⋮ Nonmonotone gradient methods for vector optimization with a portfolio optimization application ⋮ A Newton-type proximal gradient method for nonlinear multi-objective optimization problems ⋮ The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem ⋮ Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization ⋮ A weighting subgradient algorithm for multiobjective optimization ⋮ A relaxed projection method for solving multiobjective optimization problems ⋮ Conditional gradient method for multiobjective optimization ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ An efficient descent method for locally Lipschitz multiobjective optimization problems ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ A strongly convergent proximal point method for vector optimization ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds ⋮ Combined gradient methods for multiobjective optimization ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
This page was built for publication: A Subgradient Method for Vector Optimization Problems
