Generation of K-convex test problems in variable ordering settings

MaRDI QIDQ5158551zbMATH OpenFDO

Authors Daniel Hernández Escobar, G. Bouza Allende, Jan-Joachim Rückmann

Publication date 25 October 2021

Full work available at URL http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/39318/39318-10.pdf

zbMATH Keywords

\(K\)-convexity variable ordering structure vector optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Methods of reduced gradient type (90C52)

Recommendations

• On inexact projected gradient methods for solving variable vector optimization problems
• A projected gradient method for vector optimization problems
• Some properties of K-convex mappings in variable ordering settings
• A steepest descent-like method for variable order vector optimization problems
• A Newton-like method for variable order vector optimization problems

Cites work

• A Newton-like method for variable order vector optimization problems
• A steepest descent-like method for variable order vector optimization problems
• Bishop-Phelps cones in optimization
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Inradius and circumradius of various convex cones arising in applications
• Variable ordering structures in vector optimization
• Variable preference modeling with ideal-symmetric convex cones
• Variational Analysis

Cited in

(2)

• A first bibliography on set and vector optimization problems with respect to variable domination structures
• Some properties of K-convex mappings in variable ordering settings

This page was built for publication: Generation of \(K\)-convex test problems in variable ordering settings

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