Testing copositivity with the help of difference-of-convex optimization
DOI10.1007/s10107-012-0625-9zbMath1290.90062OpenAlexW1996867747MaRDI QIDQ359631
Jean-Baptiste Hiriart-Urruty, Mirjam Dür
Publication date: 12 August 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0625-9
nonconvex dualitycopositive matricesdifference-of-convex (d.c.)Legendre-Fenchel transformssubgradient algorithms for d.c. functions
Nonconvex programming, global optimization (90C26) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Quadratic and bilinear forms, inner products (15A63)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Copositive optimization -- recent developments and applications
- On the stability of rotating heavy chains
- Duality in nonconvex optimization
- A duality principle for non-convex optimisation and the calculus of variations
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- Local minima of quadratic forms on convex cones
- Algorithmic copositivity detection by simplicial partition
- Quartic formulation of standard quadratic optimization problems
- A Variational Approach to Copositive Matrices
- Some NP-complete problems in quadratic and nonlinear programming
- A Fenchel-Rockafellar type duality theorem for maximization
This page was built for publication: Testing copositivity with the help of difference-of-convex optimization