A subgradient method for vector optimization problems
From MaRDI portal
Recommendations
- A projected gradient method for vector optimization problems
- A subgradient method for multiobjective optimization
- On the convergence of the projected gradient method for vector optimization
- Inexact projected gradient method for vector optimization
- A proximal gradient splitting method for solving convex vector optimization problems
Cited in
(54)- A computational evaluation of two subgradient search methods
- Nonmonotone gradient methods for vector optimization with a portfolio optimization application
- A weighting subgradient algorithm for multiobjective optimization
- A relaxed projection method for solving multiobjective optimization problems
- A projected gradient method for vector optimization problems
- Conditional gradient method for multiobjective 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
- Combined gradient methods for multiobjective optimization
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization
- On inexact projected gradient methods for solving variable vector optimization problems
- A study of Liu-Storey conjugate gradient methods for vector optimization
- On the extension of the Hager-Zhang conjugate gradient method for vector optimization
- A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- A subgradient method for multiobjective optimization
- Inexact projected gradient method for vector optimization
- Subgradient algorithms for solving variable inequalities
- On the convergence of the projected gradient method for vector optimization
- A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
- Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- 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
- Nonlinear Conjugate Gradient Methods for Vector Optimization
- A proximal gradient splitting method for solving convex vector optimization problems
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Spectral conjugate gradient methods for vector optimization problems
- Convergence rates of the stochastic alternating algorithm for bi-objective optimization
- Conditional gradient method for vector optimization
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems
- Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization
- Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem
- On the extension of Dai-Liao conjugate gradient method for vector optimization
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- A hybrid gradient method for vector optimization problems
- On the Dai–Liao conjugate gradient method for vector optimization
- A proximal gradient method with an explicit line search for multiobjective optimization
- A modified Polak-Ribière-Polyak type conjugate gradient method for vector optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Cubic regularization technique of the Newton method for vector optimization
- Efficient nonlinear conjugate gradient techniques for vector optimization problems
- Adaptive generalized conditional gradient method for multiobjective optimization
- An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
- New hybrid conjugate gradient algorithm for vector optimization problems
- A vector restricted variant MVHS+ CG method based algorithm for unconstrained vector optimization problems
- A generalized conditional gradient method for multiobjective composite optimization problems
- Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials
- The projected gradient direction in vector optimization: continuity and dual characterization
- The generalized conditional gradient method for multiobjective composite optimization problems with non-monotone line search
- Projected quasi-subgradient method for Hölder continuous quasi-convex multiobjective optimization
This page was built for publication: A subgradient method for vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408215)