A support function approach for characterizations of convex normal cone

MaRDI QIDQ6621979

Kwan Deok Bae, D. S. Kim

Publication date: 21 October 2024

Published in: Minimax Theory and its Applications (Search for Journal in Brave)

zbMATH Keywords

normal conesupport functionFarkas' lemma

Mathematics Subject Classification ID

Convex programming (90C25) Semi-infinite programming (90C34)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
• Selected topics in robust convex optimization
• Duality in robust optimization: Primal worst equals dual best
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
• Exact relaxations for parametric robust linear optimization problems
• Surrogate duality for robust optimization
• Robust convex optimization
• Introduction to Nonlinear Optimization
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Variational Analysis and Applications
• Convex Analysis

This page was built for publication: A support function approach for characterizations of convex normal cone

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