Pages that link to "Item:Q911993"
From MaRDI portal
The following pages link to Active constraints, indefinite quadratic test problems, and complexity (Q911993):
Displaying 11 items.
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- The maximum clique problem (Q1318271) (← links)
- On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
- Algorithms for approximate linear regression design with application to a first order model with heteroscedasticity (Q1621395) (← links)
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints (Q2276880) (← links)
- The clique problem for graphs with a few eigenvalues of the same sign (Q2355311) (← links)
- On the equivalence between some discrete and continuous optimization problems (Q2640444) (← links)
- Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection (Q5882243) (← links)