Ask a Question

Prefer a chat interface with context about you and your work?

Facial reduction for a cone-convex programming problem

Facial reduction for a cone-convex programming problem

Abstract In this paper we study the abstract convex program where S is an arbitrary convex cone in a finite dimensional space, Ω is a convex set and p and g are respectively convex and S (on Ω). We use the concept of a minimal cone for (P) to correct …