Angular analysis of two classes of non - polyhedral convex cones : the point of view of optimization theory ∗
نویسنده
چکیده
There are three related concepts that arise in connection with the angular analysis of a convex cone: antipodality, criticality, and Nash equilibria. These concepts are geometric in nature but they can also be approached from the perspective of optimization theory. A detailed angular analysis of polyhedral convex cones has been carried out in a recent work of ours. This note focus on two important classes of non-polyhedral convex cones: elliptic cones in an Euclidean vector space and spectral cones in a space of symmetric matrices. Mathematical subject classification: 52A40, 90C26.
منابع مشابه
Exact Conic Programming Relaxations for a Class of Convex Polynomial Cone Programs
In this paper, under a suitable regularity condition, we establish that a broad class of conic convex polynomial optimization problems, called conic sum-of-squares convex polynomial programs, exhibits exact conic programming relaxation, which can be solved by various numerical methods such as interior point methods. By considering a general convex cone-program, we give unified results that appl...
متن کاملThe Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems
In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...
متن کامل1 Interior - point methods for large - scale cone programming
In the conic formulation of a convex optimization problem the constraints are expressed as linear inequalities with respect to a possibly non-polyhedral convex cone. This makes it possible to formulate elegant extensions of interior-point methods for linear programming to general nonlinear convex optimization. Recent research on cone programming algorithms has particularly focused on three conv...
متن کاملA cone theoretic Krein-Milman theorem in semitopological cones
In this paper, a Krein-Milman type theorem in $T_0$ semitopological cone is proved, in general. In fact, it is shown that in any locally convex $T_0$ semitopological cone, every convex compact saturated subset is the compact saturated convex hull of its extreme points, which improves the results of Larrecq.
متن کاملBornological Completion of Locally Convex Cones
In this paper, firstly, we obtain some new results about bornological convergence in locally convex cones (which was studied in [1]) and then we introduce the concept of bornological completion for locally convex cones. Also, we prove that the completion of a bornological locally convex cone is bornological. We illustrate the main result by an example.
متن کامل