Immobile indices and CQ-free optimality criteria for linear copositive programming problems

DOI10.1007/s11228-019-00527-yzbMath1442.90145OpenAlexW3003693830MaRDI QIDQ2174923

O. I. Kostyukova, Olga S. Dudina, Tatiana V. Tchemisova

Publication date: 27 April 2020

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionscopositive programmingsemi-infinite programmingconstraint qualificationstrong dualitynormalized immobile index set

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)

Related Items (4)

On equivalent representations and properties of faces of the cone of copositive matrices ⋮ On strong duality in linear copositive programming ⋮ An exact explicit dual for the linear copositive programming problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal zeros of copositive matrices
• Copositive optimization -- recent developments and applications
• Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
• Optimality criteria without constraint qualifications for linear semidefinite problems
• On relaxing the Mangasarian-Fromovitz constraint qualification
• Generalized differentials of nonsmooth functions, and necessary conditions for an extremum
• Semi-infinite optimization: Structure and stability of the feasible set
• An exact duality theory for semidefinite programming and its complexity implications
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
• Strong duality and minimal representations for cone optimization
• Stationarity and regularity of infinite collections of sets
• 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
• About regularity of collections of sets
• Extreme copositive quadratic forms
• Irreducible elements of the copositive cone
• On generalized semi-infinite optimization of genetic networks
• Approximation of the Stability Number of a Graph via Copositive Programming
• Stability of Error Bounds for Semi-infinite Convex Constraint Systems
• A Variational Approach to Copositive Matrices
• Stability of Error Bounds for Convex Constraint Systems in Banach Spaces
• Semi-Infinite Programming: Theory, Methods, and Applications
• Strict (ε, δ)-Subdifferentials and Extremality Conditions
• Some NP-complete problems in quadratic and nonlinear programming
• Strong Duality for Semidefinite Programming
• Weak Stationarity: Eliminating the gap between necessary and sufficient conditions
• Calmness Modulus of Linear Semi-infinite Programs
• Optimality conditions for linear copositive programming problems with isolated immobile indices
• 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
• APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS
• Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
• Considering copositivity locally

This page was built for publication: Immobile indices and CQ-free optimality criteria for linear copositive programming problems