Kurt M. Anstreicher
Affiliations: | Applied Mathematical & Computational Sciences | University of Iowa, Iowa City, IA |
Area:
Applied Mathematics, Computer ScienceGoogle:
"Kurt Anstreicher"Children
Sign in to add trainee| Nathan W. Brixius | grad student | 2000 | University of Iowa |
| Jon W. Van Laarhoven | grad student | 2010 | University of Iowa |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Anstreicher KM. (2021) Testing copositivity via mixed–integer linear programming Linear Algebra and Its Applications. 609: 218-230 |
| Anstreicher KM. (2020) Efficient Solution of Maximum-Entropy Sampling Problems Operations Research |
| Anstreicher KM. (2018) Maximum-entropy sampling and the Boolean quadric polytope Journal of Global Optimization. 72: 603-618 |
| Yang B, Anstreicher KM, Burer S. (2018) Quadratic programs with hollows Mathematical Programming. 170: 541-553 |
| Anstreicher KM. (2017) Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem Siam Journal On Optimization. 27: 368-378 |
| Burer S, Anstreicher KM. (2013) Second-order-cone constraints for extended trust-region subproblems Siam Journal On Optimization. 23: 432-451 |
| Van Laarhoven JW, Anstreicher KM. (2013) Geometric conditions for Euclidean Steiner trees in R d Computational Geometry: Theory and Applications. 46: 520-531 |
| Dong H, Anstreicher KM. (2013) Separating doubly nonnegative and completely positive matrices Mathematical Programming. 137: 131-153 |
| Anstreicher KM. (2012) Interior-point algorithms for a generalization of linear programming and weighted centring Optimization Methods and Software. 27: 605-612 |
| Anstreicher KM. (2012) On convex relaxations for quadratically constrained quadratic programming Mathematical Programming. 136: 233-251 |