Optimality conditions for linear copositive programming problems with isolated immobile indices

DOI10.1080/02331934.2018.1539482MaRDI QIDQ5207739zbMATH OpenOpenAlexFDO

Authors 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

constraint qualificationsconvex programmingcopositive programmingimmobile indexoptimality conditionssemi-infinite programmingstrong duality

Mathematics Subject Classification ID

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

Recommendations

• Immobile indices and CQ-free optimality criteria for linear copositive programming problems
• Optimality criteria without constraint qualifications for linear semidefinite problems
• On strong duality in linear copositive programming
• An exact explicit dual for the linear copositive programming problem
• Regularization algorithms for linear copositive problems

Cites work

• A variational approach to copositive matrices
• Algorithmic copositivity detection by simplicial partition
• Algorithms for determining the copositivity of a given symmetric matrix
• Approximation of the stability number of a graph via copositive programming
• Considering copositivity locally
• Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
• Copositive optimization -- recent developments and applications
• Copositive programming via semi-infinite optimization
• Copositivity and constrained fractional quadratic problems
• Copositivity and the Minimization of Quadratic Functions with Nonnegativity and Quadratic Equality Constraints
• scientific article; zbMATH DE number 3737415 (Why is no real title available?)
• scientific article; zbMATH DE number 1070896 (Why is no real title available?)
• scientific article; zbMATH DE number 1933860 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• Implicit optimality criterion for convex SIP problem with box constrained index set
• 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
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Open problems in the theory of completely positive and copositive matrices
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• Optimality criteria without constraint qualifications for linear semidefinite problems
• Some NP-complete problems in quadratic and nonlinear programming
• Strong duality and minimal representations for cone optimization
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization

Cited in

(6)

• On strong duality in linear copositive programming
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems
• An exact explicit dual for the linear copositive programming problem
• Regularization algorithms for linear copositive problems
• On the uniform duality in copositive optimization
• New applications of linear semi-infinite optimization theory in copositive optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207739)