Linear variational principle for convex vector maximization

DOI10.1007/s10559-007-0043-9zbMath1136.49022OpenAlexW1979186789MaRDI QIDQ2458050

Yanyan Li

Publication date: 31 October 2007

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-007-0043-9

zbMATH Keywords

linear operatorsmall perturbationresolvabilityvector maximization\(K\)-convexity

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Control/observation systems in abstract spaces (93C25)

Related Items (3)

Categorical properties of solvability for one class of minimization problems ⋮ Combinatorial optimization under uncertainty ⋮ Convex maximization and Schachermayer property \(\alpha \)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the variational principle
• On the vectorial Ekeland's variational principle and minimal points in product spaces
• On operators which attain their norm
• εVariational inequalities for vector approximation problems
• A Smooth Variational Principle With Applications to Subdifferentiability and to Differentiability of Convex Functions
• On the Subdifferentiability of Convex Functions

This page was built for publication: Linear variational principle for convex vector maximization