EUVIMEDDescobrir EUVIMED
Open access · CC BY 4.0

On Parametric Copositive Programming Problems

Olga Kostyukova

Journal of Convex Analysis · 2027 · 34 (1) · 391-407

DOI: 10.68381/jca34026 ↗

At a glance

Journal article in Journal of Convex Analysis, 2027. Written by Olga Kostyukova. 27 references. The full text is freely available (open access, CC BY 4.0).

ResumoDados bibliográficosCiteRelated studies

Abstract (original language)

We consider a class of one-parametric copositive programming problems. The aim of the paper is to describe the behavior of solutions to these parametric problems under small parameter perturbations. To do this, we explore the properties of the unperturbed copositive programming problem and show that, under some assumptions, it is closely related to a special type of block semi-infinite programming problem. Taking into account this relationship and the known results on properties of the complementary set of the copositive cone, we obtain a system of a finite number of bi-linear and linear equations with respect to a finite number of variables and a parameter. Under the assumptions made, for any parameter value from a neighborhood of unperturbed parameter value, the system has a unique solution, which allows us to construct optimal primal and dual solutions to the corresponding parametric copositive programming problem.

Cite

APA

Kostyukova, O. (2027). On Parametric Copositive Programming Problems. Journal of Convex Analysis, 34(1), 391-407. https://doi.org/10.68381/jca34026

Vancouver

Kostyukova O. On Parametric Copositive Programming Problems. Journal of Convex Analysis. 2027;34(1):391-407. doi:10.68381/jca34026

BibTeX
@article{Kostyukova2027,
  author = {Kostyukova, Olga},
  title = {On Parametric Copositive Programming Problems},
  journal = {Journal of Convex Analysis},
  year = {2027},
  volume = {34},
  number = {1},
  pages = {391--407},
  doi = {10.68381/jca34026}
}
Start for free →