On inexact projected gradient methods for solving variable vector optimization problems

DOI10.1007/s11081-020-09579-8zbMath1485.90122OpenAlexW3109826610MaRDI QIDQ2138300

Gemayqzel Bouza Allende, José Yunier Bello Cruz

Publication date: 11 May 2022

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-020-09579-8

zbMATH Keywords

vector optimizationgradient methodvariable orderweakly efficient points\(K\)-convexity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Methods of reduced gradient type (90C52) Convexity properties of solutions to PDEs with constant coefficients (35E10)

Related Items (2)

A first bibliography on set and vector optimization problems with respect to variable domination structures ⋮ Some properties of K-convex mappings in variable ordering settings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subgradient algorithms for solving variable inequalities
• A steepest descent-like method for variable order vector optimization problems
• A subgradient-like algorithm for solving vector convex inequalities
• 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
• Scalarization of vector optimization problems
• 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
• Variational analysis in psychological modeling
• On set-valued optimization problems with variable ordering structure
• Fixed points and variational principles with applications to capability theory of wellbeing via variational rationality
• Inexact projected gradient method for vector optimization
• 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
• 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
• Pareto Optimality
• Newton's Method for Multiobjective Optimization
• Entropy-Like Proximal Methods in Convex Programming
• Full convergence of the steepest descent method with inexact line searches
• Vector Optimization in Medical Engineering
• Application of a Vector-Valued Ekeland-Type Variational Principle for Deriving Optimality Conditions
• Proximal Methods in Vector Optimization
• Variable Ordering Structures in Vector Optimization
• A Subgradient Method for Vector Optimization Problems
• The concave nontransitive consumer

This page was built for publication: On inexact projected gradient methods for solving variable vector optimization problems