Testing copositivity with the help of difference-of-convex optimization

DOI10.1007/s10107-012-0625-9zbMath1290.90062MaRDI QIDQ359631

Mirjam Dür, Jean-Baptiste Hiriart-Urruty

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

zbMATH Keywords

nonconvex duality; copositive matrices; difference-of-convex (d.c.); Legendre-Fenchel transforms; subgradient algorithms for d.c. functions

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics

15A63: Quadratic and bilinear forms, inner products

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