A hybrid gradient method for vector optimization problems

DOI10.1007/S11075-025-02009-9MaRDI QIDQ6875901zbMATH OpenFDO

Authors Ray G. Serra, Sandoel Vieira

Publication date 13 January 2026

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11075-025-02009-9

zbMATH Keywords

convex programmingfull convergenceprojection methodssteepest descent methodstrong convergencevector optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Cites work

• A new duality theory for mathematical programming
• A Newton-like method for variable order vector optimization problems
• A projected gradient method for vector optimization problems
• A proximal gradient splitting method for solving convex vector optimization problems
• A proximal point-type method for multicriteria optimization
• A quadratically convergent Newton method for vector optimization
• A quasi-Newton method with Wolfe line searches for multiobjective optimization
• A refined proximal algorithm for nonconvex multiobjective optimization in Hilbert spaces
• A steepest descent method for vector optimization
• A steepest descent-like method for variable order vector optimization problems
• A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
• A strongly convergent proximal point method for vector optimization
• A subgradient method for multiobjective optimization
• A subgradient method for vector optimization problems
• A subgradient-like algorithm for solving vector convex inequalities
• An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
• Conditional gradient method for multiobjective optimization
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Forcing strong convergence of proximal point iterations in a Hilbert space
• Functional analysis, Sobolev spaces and partial differential equations
• Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 1369459 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• Inertial forward–backward methods for solving vector optimization problems
• Monotone Operators and the Proximal Point Algorithm
• Newton's method for multiobjective optimization
• Nonlinear Conjugate Gradient Methods for Vector Optimization
• Nonmonotone line searches for unconstrained multiobjective optimization problems
• On inexact projected gradient methods for solving variable vector optimization problems
• On the convergence of the projected gradient method for vector optimization
• On the extension of the Hager-Zhang conjugate gradient method for vector optimization
• On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
• Proximal gradient methods for multiobjective optimization and their applications
• Proximal Methods in Vector Optimization
• Proximal point method for a special class of nonconvex multiobjective optimization functions
• Steepest descent methods for multicriteria optimization.
• Strong convergence in Hilbert spaces via -duality
• Subgradient algorithms for solving variable inequalities
• The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
• Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds

This page was built for publication: A hybrid gradient method for vector optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875901)