Copositive programming via semi-infinite optimization
From MaRDI portal
Publication:2435031
DOI10.1007/s10957-013-0344-2zbMath1282.90203OpenAlexW2132686144MaRDI QIDQ2435031
Faizan Ahmed, Mirjam Dür, Georg Still
Publication date: 3 February 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0344-2
copositive programmingdiscretization methodsemi-infinite programmingoptimality and dualityorder of maximizer
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items
On equivalent representations and properties of faces of the cone of copositive matrices ⋮ On strong duality in linear copositive programming ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ First order solutions in conic programming ⋮ An exact explicit dual for the linear copositive programming problem ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Genericity Results in Linear Conic Programming—A Tour d’Horizon ⋮ Unnamed Item ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ Optimality conditions for linear copositive programming problems with isolated immobile indices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Semi-infinite programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- On the accuracy of uniform polyhedral approximations of the copositive cone
- An improved characterisation of the interior of the completely positive cone
- Semi-Infinite Programming: Theory, Methods, and Applications
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Discretization in semi-infinite programming: the rate of convergence
