A support function approach for characterizations of convex normal cone
From MaRDI portal
Recommendations
Cites work
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Convex Analysis
- Duality in robust optimization: Primal worst equals dual best
- Exact relaxations for parametric robust linear optimization problems
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 5982713 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- Introduction to nonlinear optimization: theory, algorithms, and applications with MATLAB
- Representation of the normal cone and its applications in robust minimax programming problems
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- Robust convex optimization
- Robust optimization
- Selected topics in robust convex optimization
- Strong duality in robust convex programming: complete characterizations
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Surrogate duality for robust optimization
- Variational analysis and applications
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)
