- Title
- Refining the partition for multifold conic optimization problems
- Creator
- Ramirez, Hector; Roshchina, Vera
- Date
- 2020
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/174747
- Identifier
- vital:14905
- Identifier
-
https://doi.org/10.1080/02331934.2020.1822835
- Identifier
- ISBN:0233-1934
- Abstract
- In this paper, we give a unified treatment of two different definitions of complementarity partition of multifold conic programs introduced independently in Bonnans and Ramirez [Perturbation analysis of second-order cone programming problems, Math Program. 2005;104(2-30):205-227] for conic optimization problems, and in Pena and Roshchina [A complementarity partition theorem for multifold conic systems, Math Program. 2013;142(1-2):579-589] for homogeneous feasibility problems. We show that both can be treated within the same unified geometric framework and extend the latter notion to optimization problems. We also show that the two partitions do not coincide, and their intersection gives a seven-set index partition. Finally, we demonstrate that the partitions are preserved under the application of nonsingular linear transformations, and in particular, that a standard conversion of a second-order cone program into a semidefinite programming problem preserves the partitions.; This research was partially supported by ANID (Chile) under REDES project number 180032 and by the Australian Research Council grant DE150100240. The second author was supported by FONDECYT (Fondo de Fomento al Desarrollo Cientifico y Tecnologico) regular projects 1160204 and 1201982, and Basal Program CMM-AFB 170001 (Comision Nacional de Investigacion Cientifica y Tecnologica), all from ANID (Chile).
- Publisher
- Taylor & Francis
- Relation
- Optimization Vol. 69, no. 11 (2020), p. 2489-2507
- Rights
- Metadata is freely available under a CCO license
- Rights
- Copyright © 2020 Informa UK Limited, trading as Taylor & Francis Group
- Rights
- Open Access
- Subject
- 0102 Applied Mathematics; 0103 Numerical and Computational Mathematics; Linear conic programming; Optimal partition; Feasibility problems
- Full Text
- Reviewed
- Funder
- This research was partially supported by ANID (Chile) under REDES project number 180032 and by the Australian Research Council grant DE150100240. The second author was supported by FONDECYT (Fondo de Fomento al Desarrollo Cientifico y Tecnologico) regular projects 1160204 and 1201982, and Basal Program CMM-AFB 170001 (Comision Nacional de Investigacion Cientifica y Tecnologica), all from ANID (Chile).
- Hits: 658
- Visitors: 692
- Downloads: 61
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted version | 424 KB | Adobe Acrobat PDF | View Details Download |