A steepest descent-like method for variable order vector optimization problems
From MaRDI portal
Recommendations
- A steepest descent-like method for vector optimization problems with variable domination structure
- A steepest descent method for vector optimization
- A Newton-like method for variable order vector optimization problems
- Steepest descent methods for critical points in vector optimization problems
- Concepts for approximate solutions of vector optimization problems with variable order structures
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Convergence for vector optimization problems with variable ordering structure
- scientific article; zbMATH DE number 3956829
- Variations of the steepest descent method in nonrestricted optimization
- Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
Cites work
- scientific article; zbMATH DE number 3926624 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
- A projected gradient method for vector optimization problems
- A steepest descent method for vector optimization
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
- Advancing equitability in multiobjective programming
- Application of a Vector-Valued Ekeland-Type Variational Principle for Deriving Optimality Conditions
- Convergence of a projected gradient method variant for quasiconvex objectives
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Convex vector functions and their subdifferential
- Entropy-Like Proximal Methods in Convex Programming
- Full convergence of the steepest descent method with inexact line searches
- Introduction to clustering large and high-dimensional data.
- Newton's method for multiobjective optimization
- On the choice of parameters for the weighting method in vector optimization
- On the convergence of the projected gradient method for vector optimization
- Optimal elements in vector optimization with a variable ordering structure
- Optimality conditions for set-valued optimization problems
- Pareto Optimality
- Proximal Methods in Vector Optimization
- Scalarization in vector optimization
- Scalarization of vector optimization problems
- Steepest descent methods for multicriteria optimization.
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Variable preference modeling with ideal-symmetric convex cones
Cited in
(19)- A first bibliography on set and vector optimization problems with respect to variable domination structures
- Characterization of properly optimal elements with variable ordering structures
- A steepest descent method for vector optimization
- Continuity of a scalarization in vector optimization with variable ordering structures and application to convergence of minimal solutions
- A relaxed projection method for solving multiobjective optimization problems
- Conditional gradient method for multiobjective optimization
- A steepest descent-like method for vector optimization problems with variable domination structure
- Steepest descent methods for critical points in vector optimization problems
- On inexact projected gradient methods for solving variable vector optimization problems
- A proximal gradient splitting method for solving convex vector optimization problems
- A Newton-like method for variable order vector optimization problems
- Variational analysis in psychological modeling
- Dual descent methods as tension reduction systems
- Two Set Scalarizations Based on the Oriented Distance with Variable Ordering Structures: Properties and Application to Set Optimization
- Generation of \(K\)-convex test problems in variable ordering settings
- Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach
- Subgradient algorithms for solving variable inequalities
- Some properties of \(K\)-convex mappings in variable ordering settings
- Iteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifolds
This page was built for publication: A steepest descent-like method for variable order vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467437)
