A barrier method in convex vector optimization with generalized inequality constraints

DOI10.1007/s11590-019-01393-1zbMath1468.90121OpenAlexW2914837546WikidataQ128503020 ScholiaQ128503020MaRDI QIDQ2174915

Marius Durea, Radu Strugariu

Publication date: 27 April 2020

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-019-01393-1

zbMATH Keywords

barrier methodopennessGerstewitz scalarizationvector convexity

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Cites Work

• Erratum to: ``On convex optimization without convex representation
• Barrier method in nonsmooth convex optimization without convex representation
• On convex optimization without convex representation
• On representations of the feasible set in convex optimization
• Variational methods in partially ordered spaces
• Optimality conditions and a barrier method in optimization with convex geometric constraint
• Optimality conditions in convex optimization revisited
• Nonsmooth sequential analysis in Asplund spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A barrier method in convex vector optimization with generalized inequality constraints