A steepest descent-like method for variable order vector optimization problems
From MaRDI portal
Publication:467437
DOI10.1007/s10957-013-0308-6zbMath1315.90042OpenAlexW2090145095MaRDI QIDQ467437
José Yunier Bello Cruz, Gemayqzel Bouza Allende
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0308-6
Related Items
A proximal gradient splitting method for solving convex vector optimization problems, Continuity of a scalarization in vector optimization with variable ordering structures and application to convergence of minimal solutions, Subgradient algorithms for solving variable inequalities, On inexact projected gradient methods for solving variable vector optimization problems, A steepest descent-like method for vector optimization problems with variable domination structure, A first bibliography on set and vector optimization problems with respect to variable domination structures, A Newton-like method for variable order vector optimization problems, Some properties of K-convex mappings in variable ordering settings, Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach, A relaxed projection method for solving multiobjective optimization problems, Variational analysis in psychological modeling, Characterization of properly optimal elements with variable ordering structures, Conditional gradient method for multiobjective optimization, Dual descent methods as tension reduction systems, Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds, Two Set Scalarizations Based on the Oriented Distance with Variable Ordering Structures: Properties and Application to Set Optimization, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Convex vector functions and their subdifferential
- Optimality conditions for set-valued optimization problems
- Steepest descent methods for multicriteria optimization.
- 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
- 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
- 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
