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

DOI10.1007/S10107-012-0625-9MaRDI QIDQ359631zbMATH OpenOpenAlexFDO

Authors 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

copositive matricesdifference-of-convex (d.c.)Legendre-Fenchel transformsnonconvex dualitysubgradient algorithms for d.c. functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic and bilinear forms, inner products (15A63) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Recommendations

• Copositivity meets D. C. optimization
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• Quadratic factorization heuristics for copositive programming
• An improved algorithm to test copositivity
• Quadratic-programming criteria for copositive matrices

Cites work

• scientific article; zbMATH DE number 4041643 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 3201668 (Why is no real title available?)
• A Fenchel-Rockafellar type duality theorem for maximization
• A duality principle for non-convex optimisation and the calculus of variations
• A variational approach to copositive matrices
• Algorithmic copositivity detection by simplicial partition
• Copositive optimization -- recent developments and applications
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• Duality in nonconvex optimization
• Local minima of quadratic forms on convex cones
• On the stability of rotating heavy chains
• Quartic formulation of standard quadratic optimization problems
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Some NP-complete problems in quadratic and nonlinear programming
• Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches

Cited in

(13)

• A new nonconvex approach for image restoration with Gamma noise
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
• A complete semidefinite algorithm for detecting copositive matrices and tensors
• A refined inertial DC algorithm for DC programming
• Detection of a copositive matrix over a \(p\)-th order cone
• LP-based tractable subcones of the semidefinite plus nonnegative cone
• Variational multiplicative noise removal by DC programming
• Minimizing sequences in a constrained DC optimization problem
• Copositivity meets D. C. optimization
• A copositive framework for analysis of hybrid Ising-classical algorithms
• A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
• The boosted DC algorithm for linearly constrained DC programming
• On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials

This page was built for publication: Testing copositivity with the help of difference-of-convex optimization

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