On strong duality in linear copositive programming
From MaRDI portal
Publication:2149604
DOI10.1007/s10898-021-00995-3zbMath1489.90119arXiv2004.09865OpenAlexW3130358933MaRDI QIDQ2149604
O. I. Kostyukova, Tatiana V. Tchemisova
Publication date: 29 June 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.09865
constraint qualificationstrong dualitysemidefinite programming (SDP)semi-infinite programming (SIP)extended dual problemlinear copositive programmingnormalized immobile index set
Related Items
Special issue: 18th international conference on mathematical optimization theory and operations research (MOTOR 2019) ⋮ An exact explicit dual for the linear copositive programming problem ⋮ Lagrangian duality in convex conic programming with simple proofs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- Optimality criteria without constraint qualifications for linear semidefinite problems
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- Strong duality and minimal representations for cone optimization
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Copositive programming via semi-infinite optimization
- Invariance and efficiency of convex representations
- Interior Point Methods for Nonlinear Optimization
- Strong Duality for Semidefinite Programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Duality for semi-definite and semi-infinite programming
- Advanced Time Series Data Analysis
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- On the irreducibility, self-duality an non-homogeneity of completely positive cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On copositive programming and standard quadratic optimization problems
- Perfect duality in semi-infinite and semidefinite programming
- Considering copositivity locally
This page was built for publication: On strong duality in linear copositive programming
