A steepest descent-like method for vector optimization problems with variable domination structure

DOI10.23952/jnva.6.2022.6.02OpenAlexW4312513771MaRDI QIDQ5052577

Christiane Tammer, Gemayqzel Bouza Allende

Publication date: 25 November 2022

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.6.2022.6.02

zbMATH Keywords

nondominated solutionsteepest descent-like methodvector optimization with variable domination structures

Mathematics Subject Classification ID

Operator theory (47-XX) Functional analysis (46-XX)

Related Items (1)

An accelerated proximal gradient method for multiobjective optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient algorithms for solving variable inequalities
• A steepest descent-like method for variable order vector optimization problems
• Convergence of the projected gradient method for quasiconvex multiobjective optimization
• Optimal elements in vector optimization with a variable ordering structure
• Variable preference modeling with ideal-symmetric convex cones
• Convergence of a projected gradient method variant for quasiconvex objectives
• Scalarization of vector optimization problems
• Generalization of domination structures and nondominated solutions in multicriteria decision making
• Steepest descent methods for multicriteria optimization.
• A Newton-like method for variable order vector optimization problems
• A steepest descent method for vector optimization
• A projected gradient method for vector optimization problems
• Advancing equitability in multiobjective programming
• On the choice of parameters for the weighting method in vector optimization
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Optimality conditions for vector optimization problems with variable ordering structures
• Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
• On the convergence of the projected gradient method for vector optimization
• Scalarization in vector optimization
• Newton's Method for Multiobjective Optimization
• Entropy-Like Proximal Methods in Convex Programming
• Full convergence of the steepest descent method with inexact line searches
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
• Application of a Vector-Valued Ekeland-Type Variational Principle for Deriving Optimality Conditions
• Proximal Methods in Vector Optimization
• Variable Ordering Structures in Vector Optimization

This page was built for publication: A steepest descent-like method for vector optimization problems with variable domination structure