Pages that link to "Item:Q1315437"

The following pages link to A finite algorithm for solving general quadratic problems (Q1315437):

Displaying 17 items.

• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
• Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
• Properties of two DC algorithms in quadratic programming (Q628748) (← links)
• Decomposition methods for solving nonconvex quadratic programs via branch and bound (Q811889) (← links)
• A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
• Global optimality conditions for some classes of optimization problems (Q970570) (← links)
• Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
• Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
• A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
• Boundedness of a type of iterative sequences in two-dimensional quadratic programming (Q2260662) (← links)
• Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation (Q2379693) (← links)
• Block pivoting and shortcut strategies for detecting copositivity (Q2564929) (← links)
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems (Q2572774) (← links)
• Copositive realxation for genera quadratic programming (Q4391294) (← links)