A steepest descent method for set optimization problems with set-valued mappings of finite cardinality

DOI10.1007/s10957-021-01887-yzbMath1478.90116arXiv2107.12122OpenAlexW3184796014MaRDI QIDQ2231334

Ernest Quintana, Gemayqzel Bouza Allende, Christiane Tammer

Publication date: 29 September 2021

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

Full work available at URL: https://arxiv.org/abs/2107.12122

zbMATH Keywords

stationary pointdescent methodset optimizationrobust vector optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (2)

A Vectorization Scheme for Nonconvex Set Optimization Problems ⋮ Conjugate duality in set optimization via nonlinear scalarization

Uses Software

• ECOS
• CVXPY

Cites Work

• Minmax robustness for multi-objective optimization problems
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
• New order relations in set optimization
• Multiobjective search algorithm with subdivision technique
• Nonsmooth analysis
• Variational methods in partially ordered spaces
• Partial order relations on family of sets and scalarizations for set optimization
• Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
• A steepest descent method for vector optimization
• On set-valued optimization.
• An algorithmic approach to multiobjective optimization with decision uncertainty
• The relationship between multi-objective robustness concepts and set-valued optimization
• Generalized multiobjective robustness and relations to set-valued optimization
• A unified characterization of nonlinear scalarizing functionals in optimization
• A derivative-free descent method in set optimization
• Robust Convex Optimization
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
• Vector Optimization
• Steepest descent methods for critical points in vector optimization problems
• New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
• Introduction to Derivative-Free Optimization
• Cutting-set methods for robust convex optimization with pessimizing oracles
• On Finding the Maxima of a Set of Vectors
• On cone convexity of set-valued maps
• The Fermat Rule for Set Optimization Problems with Lipschitzian Set-Valued Mappings
• Lagrange Multiplier Rules for Weakly Minimal Solutions of Compact-Valued Set Optimization Problems
• Outer limits of subdifferentials for min–max type functions
• Set-valued Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A steepest descent method for set optimization problems with set-valued mappings of finite cardinality