Optimality conditions for linear copositive programming problems with isolated immobile indices

DOI10.1080/02331934.2018.1539482zbMath1434.90137OpenAlexW2900539153MaRDI QIDQ5207739

O. I. Kostyukova, Tatiana V. Tchemisova

Publication date: 13 January 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10773/26757

zbMATH Keywords

optimality conditionsconvex programmingcopositive programmingsemi-infinite programmingstrong dualityconstraint qualificationsimmobile index

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items (2)

On strong duality in linear copositive programming ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Copositivity and constrained fractional quadratic problems
• Copositive optimization -- recent developments and applications
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Optimality criteria without constraint qualifications for linear semidefinite problems
• Algorithms for determining the copositivity of a given symmetric matrix
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• Strong duality and minimal representations for cone optimization
• Implicit optimality criterion for convex SIP problem with box constrained index set
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Copositive programming via semi-infinite optimization
• Algorithmic copositivity detection by simplicial partition
• Approximation of the Stability Number of a Graph via Copositive Programming
• A Variational Approach to Copositive Matrices
• Open problems in the theory of completely positive and copositive matrices
• Some NP-complete problems in quadratic and nonlinear programming
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets
• On copositive programming and standard quadratic optimization problems
• Considering copositivity locally

This page was built for publication: Optimality conditions for linear copositive programming problems with isolated immobile indices