A derivative-free rooted tree method in nonconvex set optimization

MaRDI QIDQ5146253zbMATH OpenFDO

Authors Johannes Jahn

Publication date 25 January 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/Pafa/vol3/pafav3n4p603.pdf

zbMATH Keywords

set optimizationGPU computingminmax less order relation

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Derivative-free methods and methods using generalized derivatives (90C56) Generalizations of ordered sets (06A75)

Recommendations

• A derivative-free descent method in set optimization
• Characterizations of the set less order relation in nonconvex set optimization
• A Vectorization Scheme for Nonconvex Set Optimization Problems
• Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
• Generalized set order relations and their numerical treatment

Cited in

(5)

• A Vectorization Scheme for Nonconvex Set Optimization Problems
• Characterizations of the set less order relation in nonconvex set optimization
• A steepest descent method for set optimization problems with set-valued mappings of finite cardinality
• An algorithmic approach to multiobjective optimization with decision uncertainty
• A derivative-free descent method in set optimization

This page was built for publication: A derivative-free rooted tree method in nonconvex set optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146253)