Regularization Algorithms for Linear Copositive Programming Problems: An Approach Based on the Concept of Immobile Indices
Open Access
- 11 February 2022
- journal article
- research article
- Published by MDPI AG in Algorithms
- Vol. 15 (2) , 59
Abstract
In this paper, we continue an earlier study of the regularization procedures of linear copositive problems and present new algorithms that can be considered as modifications of the algorithm described in our previous publication, which is 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. The results of the paper provide a deeper understanding of the structure of feasible sets of copositive problems and can be useful for developing a duality theory for these problems.Keywords
Funding Information
- Fundação para a Ciência e a Tecnologia (UIDB/04106/2020)
This publication has 22 references indexed in Scilit:
- Copositive Programming via Semi-Infinite OptimizationJournal of Optimization Theory and Applications, 2013
- Strong duality and minimal representations for cone optimizationComputational Optimization and Applications, 2012
- Copositive optimization – Recent developments and applicationsEuropean Journal of Operational Research, 2012
- Approximation of the Stability Number of a Graph via Copositive ProgrammingSIAM Journal on Optimization, 2002
- Perfect duality in semi–infinite and semidefinite programmingMathematical Programming, 2001
- Strong Duality for Semidefinite ProgrammingSIAM Journal on Optimization, 1997
- Semi-Infinite Programming: Theory, Methods, and ApplicationsSIAM Review, 1993
- Regularizing the abstract convex programJournal of Mathematical Analysis and Applications, 1981
- Facial reduction for a cone-convex programming problemJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1980
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONSMathematics of the USSR-Sbornik, 1969