A derivative-free descent method in set optimization

DOI10.1007/s10589-014-9674-8zbMath1309.90123OpenAlexW2022546937MaRDI QIDQ2340524

Johannes Jahn

Publication date: 20 April 2015

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

Full work available at URL: https://doi.org/10.1007/s10589-014-9674-8

zbMATH Keywords

vectorizationset optimizationset less order relation

Mathematics Subject Classification ID

Partial orders, general (06A06) Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (11)

Solving set-valued optimization problems using a multiobjective approach ⋮ On the solution continuity of parametric set optimization problems ⋮ A Vectorization Scheme for Nonconvex Set Optimization Problems ⋮ An algorithmic approach to multiobjective optimization with decision uncertainty ⋮ Decision uncertainty in multiobjective optimization ⋮ A steepest descent method for set optimization problems with set-valued mappings of finite cardinality ⋮ Set approach for set optimization with variable ordering structures. II: Scalarization approaches ⋮ A generalized scalarization method in set optimization with respect to variable domination structures ⋮ Set Optimization—A Rather Short Introduction ⋮ Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization ⋮ Continuity of solutions mappings of parametric set optimization problems

Uses Software

• fminsearch

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vectorization in set optimization
• New order relations in set optimization
• Scalarization of set-valued optimization problems and variational inequalities in topological vector spaces
• Nonconvex scalarization in set optimization with set-valued maps
• The algebra of many-valued quantities
• Scalarizing vector optimization problems
• Scalarization in set optimization with solid and nonsolid ordering cones
• On the Convergence of Pattern Search Algorithms
• Duality for Set-Valued Measures of Risk
• Multivalued convexity and optimization: A unified approach to inequality and equality constraints
• SUBLINEAR OPERATORS AND THEIR APPLICATIONS
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Convergence of the Nelder--Mead Simplex Method to a Nonstationary Point
• On cone convexity of set-valued maps
• On the Local Convergence of Pattern Search
• An algorithm to solve polyhedral convex set optimization problems
• A Simplex Method for Function Minimization

This page was built for publication: A derivative-free descent method in set optimization