Pages that link to "Item:Q687097"

The following pages link to Open questions in complexity theory for numerical optimization (Q687097):

Displaying 10 items.

• On cones of nonnegative quartic forms (Q525602) (← links)
• A convex polynomial that is not sos-convex (Q715094) (← links)
• The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs (Q1804581) (← links)
• Some geometric results in semidefinite programming (Q1905963) (← links)
• Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs (Q1906278) (← links)
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables (Q1919095) (← links)
• NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
• Complexity aspects of local minima and related notions (Q2074805) (← links)
• On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789) (← links)
• On the complexity of detecting convexity over a box (Q2191776) (← links)