Pages that link to "Item:Q2089789"
From MaRDI portal
The following pages link to On the complexity of finding a local minimizer of a quadratic function over a polytope (Q2089789):
Displaying 10 items.
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- On the query complexity of finding a local maximum point. (Q1853165) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← 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 local search in unconstrained quadratic binary optimization (Q2810549) (← links)
- The complexity of gradient descent: CLS = PPAD \(\cap\) pls (Q6567266) (← links)
- Higher-order Newton methods with polynomial work per iteration (Q6608710) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
