Pages that link to "Item:Q5219559"

The following pages link to The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem (Q5219559):

Displaying 12 items.

• Chris Cannings: a life in games (Q831064) (← links)
• Constructing patterns of (many) ESSs under support size control (Q831065) (← links)
• Building a completely positive factorization (Q1787912) (← links)
• Two-stage stochastic standard quadratic optimization (Q2077956) (← links)
• A study on sequential minimal optimization methods for standard quadratic problems (Q2095525) (← links)
• On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
• On the algebraic structure of the copositive cone (Q2228386) (← links)
• Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
• Maximization of homogeneous polynomials over the simplex and the sphere: structure, stability, and generic behavior (Q2420824) (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
• Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
• The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) (← links)