Add to ORKGWhen is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
Consider a polyhedral convex cone which is given by a finite number of linear inequal-ities. We inve...
The method of alternating projections (MAP) is a common method for solving feasibility prob-lems. Wh...
Consequences of a general formulation of the theorem of the alternative are exploited
AbstractThis paper first generalizes a characterization of polyhedral sets having least elements, wh...
AbstractWe derive from Motzkin’s Theorem that a point can be strongly separated by a hyperplane from...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
A nonlinear theorem of the alternative is proposed which needs no regularity assumption. Several equ...
AbstractThis survey deals with the aspects of archimedian partially ordered finite-dimensional real ...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
In this paper, we first establish characterizations of the nonemptiness and compactness of the set o...
In this paper we study a special class of convex optimization problems called conically ordered conv...
AbstractEssential properties of multiobjective programming in real normed linear spaces are studied....
We characterize the inconsistency of certain nonlinear systems under mild convexity requirements and...
AbstractA second order dual to a non-linear program with linear constraints in complex space over ar...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
Consider a polyhedral convex cone which is given by a finite number of linear inequal-ities. We inve...
The method of alternating projections (MAP) is a common method for solving feasibility prob-lems. Wh...
Consequences of a general formulation of the theorem of the alternative are exploited
AbstractThis paper first generalizes a characterization of polyhedral sets having least elements, wh...
AbstractWe derive from Motzkin’s Theorem that a point can be strongly separated by a hyperplane from...
AbstractWe apply a recent characterization of optimality for the abstract convex program with a cone...
A nonlinear theorem of the alternative is proposed which needs no regularity assumption. Several equ...
AbstractThis survey deals with the aspects of archimedian partially ordered finite-dimensional real ...
AbstractIn this study we present an important theorem of the alternative involving convex functions ...
In this paper, we first establish characterizations of the nonemptiness and compactness of the set o...
In this paper we study a special class of convex optimization problems called conically ordered conv...
AbstractEssential properties of multiobjective programming in real normed linear spaces are studied....
We characterize the inconsistency of certain nonlinear systems under mild convexity requirements and...
AbstractA second order dual to a non-linear program with linear constraints in complex space over ar...
When is the linear image of a closed convex cone closed? We present very simple, and intuitive neces...
Consider a polyhedral convex cone which is given by a finite number of linear inequal-ities. We inve...
The method of alternating projections (MAP) is a common method for solving feasibility prob-lems. Wh...