• Corpus ID: 237372595

Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems

@inproceedings{Kostyukova2021FaceRA,
  title={Face reduction and the immobile indices approaches to regularization of linear Copositive Programming problems},
  author={O. I. Kostyukova and Tatiana Tchemisova},
  year={2021}
}
The paper is devoted to the regularization of linear Copositive Programming problems which consists of transforming a problem to an equivalent form, where the Slater condition is satisfied and the strong duality holds. We describe here two regularization algorithms based on the concept of immobile indices and an understanding of the important role these indices play in the feasible sets’ characterization. These algorithms are compared to some regularization procedures developed for a more… 
1 Citations

Regularization Algorithms for Linear Copositive Programming Problems: An Approach Based on the Concept of Immobile Indices

The main steps of the regularization algorithms proposed in this paper are explicitly described and interpreted from the point of view of the facial geometry of the cone of copositive matrices.

References

SHOWING 1-10 OF 30 REFERENCES

On equivalent representations and properties of faces of the cone of copositive matrice.

The paper is devoted to a study of the cone $\cop$ of copositive matrices. Based on the known from semi-infinite optimization concept of immobile indices, we define zero and minimal zero vectors of a

Facial Reduction Algorithms for Conic Optimization Problems

The analysis shows that, although they can be regarded as dual to each other, the facial reduction algorithm has ability to produce a finer sequence of faces of the cone including the feasible region, and a simple proof of the convergence of theacial reduction algorithm for the conic optimization is presented.

Facial reduction for a cone-convex programming problem

  • J. BorweinHenry Wolkowicz
  • Mathematics
    Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
  • 1981
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

A Simple Derivation of a Facial Reduction Algorithm and Extended Dual Systems

The Facial Reduction Algorithm (FRA) of Borwein and Wolkowicz and the Extended Dual System (EDS) of Ramana aim to better understand duality, when a conic linear system Ax K b (P) has no strictly

Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach

An algorithm based on facial reduction for solving the primal problem that, in principle, always succeeds and can be implemented by assuming oracle access to the central-path limit poi...

Immobile Indices and CQ-Free Optimality Criteria for Linear Copositive Programming Problems

We consider problems of linear copositive programming where feasible sets consist of vectors for which the quadratic forms induced by the corresponding linear matrix combinations are nonnegative over

The Many Faces of Degeneracy in Conic Optimization

Various reasons for the loss of strict feasibility are described, whether due to poor modelling choices or rich underlying structure, and ways to cope with it are discussed and, in many pronounced cases, how to use it as an advantage are discussed.

Strong Duality for Semidefinite Programming

The relationships among various duals are discussed and a unified treatment for strong duality in semidefinite programming is given.

Strong duality and minimal representations for cone optimization

A fresh look at known and new results for duality, optimality, constraint qualifications, CQ, and strict complementarity, for linear cone optimization problems in finite dimensions, with emphasis on results that deal with Semidefinite Programming, SDP.

Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets

This paper analyzes a class of convex semi-infinite programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities by employing the constructive approach, which relies on the notions of immobile indices and their immobility orders.