Pages that link to "Item:Q1281478"

The following pages link to On standard quadratic optimization problems (Q1281478):

Displaying 17 items.

• Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163) (← links)
• New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions (Q3449456) (← links)
• Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
• Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
• (Q5124683) (← links)
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
• A survey on graphs with convex quadratic stability number (Q5207733) (← links)
• The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559) (← links)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs (Q5963623) (← links)
• Copositivity tests based on the linear complementarity problem (Q5963680) (← links)
• Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
• Nonconvex homogeneous optimization: a general framework and optimality conditions of first and second-order (Q6632125) (← links)
• Game-theoretic models of moral and other-regarding agents (extended abstract) (Q6642576) (← links)
• Polyhedral properties of RLT relaxations of nonconvex quadratic programs and their implications on exact relaxations (Q6665387) (← links)