A subgradient method for multiobjective optimization

DOI10.1007/s10589-012-9494-7zbMath1267.90129OpenAlexW2034688818MaRDI QIDQ2377160

João Xavier da Cruz Neto, Jurandir O. Lopes, Geci J. P. da Silva, Orizon P. Ferreira

Publication date: 28 June 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9494-7

zbMATH Keywords

subgradient methodmultiobjective optimizationquasi-Féjer convergencePareto optimality or efficiency

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (27)

A proximal gradient splitting method for solving convex vector optimization problems ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ A conjugate directions-type procedure for quadratic multiobjective optimization ⋮ Proximal gradient methods for multiobjective optimization and their applications ⋮ Descent algorithm for nonsmooth stochastic multiobjective optimization ⋮ Conditional gradient method for vector optimization ⋮ Multiobjective BFGS method for optimization on Riemannian manifolds ⋮ A Newton-type proximal gradient method for nonlinear multi-objective optimization problems ⋮ Inexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifolds ⋮ MONOTONICITY FOR MULTIOBJECTIVE ACCELERATED PROXIMAL GRADIENT METHODS ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Memory gradient method for multiobjective optimization ⋮ Unnamed Item ⋮ 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 relaxed projection method for solving multiobjective optimization problems ⋮ Nonsmooth multiobjective programming with quasi-Newton methods ⋮ An efficient descent method for locally Lipschitz multiobjective optimization problems ⋮ 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 ⋮ A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems ⋮ On global subdifferentials with applications in nonsmooth optimization ⋮ Multi-criteria optimization in regression ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization ⋮ On strongly quasiconvex functions: existence results and proximal point algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• Steepest descent methods for multicriteria optimization.
• A steepest descent method for vector optimization
• A projected gradient method for vector optimization problems
• Proper efficiency and the theory of vector maximization
• Algorithms for the quasiconvex feasibility problem
• A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
• An Existence Theorem in Vector Optimization
• Strict lower subdifferentiability and applications
• Entropy-Like Proximal Methods in Convex Programming
• Full convergence of the steepest descent method with inexact line searches
• Convex Analysis
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization

This page was built for publication: A subgradient method for multiobjective optimization