Pages that link to "Item:Q1823293"

The following pages link to Quadratic-programming criteria for copositive matrices (Q1823293):

Displaying 15 items.

• Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• Copositivity and sparsity relations using spectral properties (Q504815) (← links)
• An algorithm for determining copositive matrices (Q636239) (← links)
• Algorithms for determining the copositivity of a given symmetric matrix (Q959864) (← links)
• Determining subspaces on which a matrix is nonnegative definite (Q1189625) (← links)
• Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
• The convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problems (Q1983743) (← links)
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems (Q2026713) (← links)
• Algorithmic copositivity detection by simplicial partition (Q2477530) (← links)
• Block pivoting and shortcut strategies for detecting copositivity (Q2564929) (← links)
• The copositive completion problem (Q2568369) (← links)
• Copositive realxation for genera quadratic programming (Q4391294) (← links)
• Foundations of Set-Semidefinite Optimization (Q5188753) (← links)
• Copositivity tests based on the linear complementarity problem (Q5963680) (← links)