On strong duality in linear copositive programming
From MaRDI portal
Publication:2149604
DOI10.1007/S10898-021-00995-3zbMATH Open1489.90119OpenAlexW3130358933MaRDI QIDQ2149604FDOQ2149604
Authors: O. I. Kostyukova, Tatiana V. Tchemisova 
Publication date: 29 June 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract: The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem satisfies the strong duality relations and does not require any additional regularity assumptions such as constraint qualifications. The main difference with the previously obtained results consists in the fact that now the extended dual problem uses neither the immobile indices themselves nor the explicit information about the convex hull of these indices. The strong duality formulations presented in the paper have similar structure and properties as that proposed in the works of M. Ramana, L. Tuncel, and H. Wolkovicz, for semidefinite programming, but are obtained using different techniques.
Full work available at URL: https://arxiv.org/abs/2004.09865
Recommendations
- Strong duality for inexact linear programming
- Strong Duality for Semidefinite Programming
- An exact explicit dual for the linear copositive programming problem
- Towards strong duality in integer programming
- Strong duality for standard convex programs
- Strong duality conditions in semidefinite programming
- On strong and total Lagrange duality for convex optimization problems
- Strong duality for generalized convex optimization problems
- scientific article; zbMATH DE number 5036103
- Duality for linear multiplicative programs
strong dualitysemidefinite programming (SDP)constraint qualificationsemi-infinite programming (SIP)extended dual problemlinear copositive programmingnormalized immobile index set
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
- Considering copositivity locally
- Copositive optimization -- recent developments and applications
- Copositive programming via semi-infinite optimization
- Duality for semi-definite and semi-infinite programming
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Interior Point Methods for Nonlinear Optimization
- Invariance and efficiency of convex representations
- Matrix differential calculus with applications in statistics and econometrics
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
- On copositive programming and standard quadratic optimization problems
- On the irreducibility, self-duality an non-homogeneity of completely positive cones
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- Optimality criteria without constraint qualifications for linear semidefinite problems
- Perfect duality in semi-infinite and semidefinite programming
- Strong Duality for Semidefinite Programming
- Strong duality and minimal representations for cone optimization
Cited In (9)
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- An exact explicit dual for the linear copositive programming problem
- Special issue: 18th international conference on mathematical optimization theory and operations research (MOTOR 2019)
- Lagrangian duality in convex conic programming with simple proofs
- On the uniform duality in copositive optimization
- Refinements and extensions of some strong duality theorems in conic linear programming
- Regularization algorithms for linear copositive problems
- Title not available (Why is that?)
This page was built for publication: On strong duality in linear copositive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149604)
