Kurt M. Anstreicher

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 7

Top Topics

Minimum Cross Entropy

Quadratic Optimization

Transformation Based Learning

Top Venues

J. Glob. Optim.

J. Optim. Theory Appl.

Publications

Kurt M. Anstreicher
Solving Two-Trust-Region Subproblems Using Semidefinite Optimization with Eigenvector Branching. J. Optim. Theory Appl. 202 (1) (2024)
Kurt M. Anstreicher, Samuel Burer, Kyungchan Park
Convex hull representations for bounded products of variables. J. Glob. Optim. 80 (4) (2021)
Kurt M. Anstreicher, Samuel Burer
Quadratic optimization with switching variables: the convex hull for n=2. Math. Program. 188 (2) (2021)
Kurt M. Anstreicher
Efficient Solution of Maximum-Entropy Sampling Problems. Oper. Res. 68 (6) (2020)
Kurt M. Anstreicher
Maximum-entropy sampling and the Boolean quadric polytope. J. Glob. Optim. 72 (4) (2018)
Boshi Yang, Kurt M. Anstreicher, Samuel Burer
Quadratic programs with hollows. Math. Program. 170 (2) (2018)
Kurt M. Anstreicher
Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem. SIAM J. Optim. 27 (1) (2017)
Hongbo Dong, Kurt M. Anstreicher
Separating doubly nonnegative and completely positive matrices. Math. Program. 137 (1-2) (2013)
Jon W. Van Laarhoven, Kurt M. Anstreicher
. Comput. Geom. 46 (5) (2013)
Samuel Burer, Kurt M. Anstreicher
Second-Order-Cone Constraints for Extended Trust-Region Subproblems. SIAM J. Optim. 23 (1) (2013)
Kurt M. Anstreicher
On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136 (2) (2012)
Kurt M. Anstreicher
Interior-point algorithms for a generalization of linear programming and weighted centring. Optim. Methods Softw. 27 (4-5) (2012)
Kurt M. Anstreicher, Samuel Burer
Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124 (1-2) (2010)
Kurt M. Anstreicher
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43 (2-3) (2009)
Kurt M. Anstreicher, Laurence A. Wolsey
Two "well-known" properties of subgradient optimization. Math. Program. 120 (1) (2009)
Kurt M. Anstreicher, Alfredo N. Iusem
Continuous optimization: 5th Brazilian workshop. Math. Program. 111 (1-2) (2008)
Marcia Fampa, Kurt M. Anstreicher
An improved algorithm for computing Steiner minimal trees in Euclidean d-space. Discret. Optim. 5 (2) (2008)
Kurt M. Anstreicher, Samuel Burer
D.C. Versus Copositive Bounds for Standard QP. J. Glob. Optim. 33 (2) (2005)
Kurt M. Anstreicher
The volumetric barrier for convex quadratic constraints. Math. Program. 100 (3) (2004)
Kurt M. Anstreicher
The Thirteen Spheres: A New Proof. Discret. Comput. Geom. 31 (4) (2004)
Kurt M. Anstreicher
Recent advances in the solution of quadratic assignment problems. Math. Program. 97 (1-2) (2003)
Kurt M. Anstreicher
Improved Linear Programming Bounds for Antipodal Spherical Codes. Discret. Comput. Geom. 28 (1) (2002)
Kurt M. Anstreicher
Improved Complexity for Maximum Volume Inscribed Ellipsoids. SIAM J. Optim. 13 (2) (2002)
Kurt M. Anstreicher, Nathan W. Brixius, Jean-Pierre Goux, Jeff T. Linderoth
Solving large quadratic assignment problems on computational grids. Math. Program. 91 (3) (2002)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
Maximum-entropy remote sampling. Discret. Appl. Math. 108 (3) (2001)
Kurt M. Anstreicher, Nathan W. Brixius
A new bound for the quadratic assignment problem based on convex quadratic programming. Math. Program. 89 (3) (2001)
Kurt M. Anstreicher
Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem. SIAM J. Optim. 11 (1) (2000)
Kurt M. Anstreicher, Henry Wolkowicz
On Lagrangian Relaxation of Quadratic Matrix Constraints. SIAM J. Matrix Anal. Appl. 22 (1) (2000)
Kurt M. Anstreicher, Margaret H. Wright
A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite. SIAM J. Optim. 11 (1) (2000)
Kurt M. Anstreicher
The Volumetric Barrier for Semidefinite Programming. Math. Oper. Res. 25 (3) (2000)
Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming. Math. Oper. Res. 24 (1) (1999)
Kurt M. Anstreicher
Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier. Math. Oper. Res. 24 (1) (1999)
Kurt M. Anstreicher
Linear Programming in O([n3/ln n]L) Operations. SIAM J. Optim. 9 (4) (1999)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. Math. Program. 85 (2) (1999)
Kurt M. Anstreicher
Towards a Practical Volumetric Cutting Plane Method for Convex Programming. SIAM J. Optim. 9 (1) (1998)
Kurt M. Anstreicher
On Vaidya's Volumetric Cutting Plane Method for Convex Programming. Math. Oper. Res. 22 (1) (1997)
Kurt M. Anstreicher, Robert M. Freund
Preface. Ann. Oper. Res. 62 (1) (1996)
Kurt M. Anstreicher
Large step volumetric potential reduction algorithms for linear programming. Ann. Oper. Res. 62 (1) (1996)
Kurt M. Anstreicher
On Long Step Path Following and SUMT for Linear and Quadratic Programming. SIAM J. Optim. 6 (1) (1996)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
Continuous Relaxations for Constrained Maximum-Entropy Sampling. IPCO (1996)
Kurt M. Anstreicher
Volumetric path following algorithms for linear programming. Math. Program. 76 (1996)
Kurt M. Anstreicher, Robert A. Bosch
A New Infinity-Norm Path Following Algorithm for Linear Programming. SIAM J. Optim. 5 (2) (1995)
Kurt M. Anstreicher, Tamás Terlaky
A Monotonic Build-Up Simplex Algorithm for Linear Programming. Oper. Res. 42 (3) (1994)
Yinyu Ye, Kurt M. Anstreicher
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP. Math. Program. 62 (1993)
Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky
A Long-Step Barrier Method for Convex Quadratic Programming. Algorithmica 10 (5) (1993)
Kurt M. Anstreicher
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming. Math. Program. 62 (1993)
Kurt M. Anstreicher, Patrick Watteyne
A Family of Search Directions for Karmarkar's Algorithm. Oper. Res. 41 (4) (1993)
Robert A. Bosch, Kurt M. Anstreicher
On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise. Algorithmica 9 (2) (1993)
Kurt M. Anstreicher
On interior algorithms for linear programming with no regularity assumptions. Oper. Res. Lett. 11 (4) (1992)
Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford
Crashing a maximum-weight complementary basis. Math. Program. 54 (1992)
Kurt M. Anstreicher, Robert A. Bosch
L) algorithm for linear programming. Math. Program. 54 (1992)
Kurt M. Anstreicher
A combined phase I-phase II scaled potential algorithm for linear programming. Math. Program. 52 (1991)
Kurt M. Anstreicher
On the Performance of Karmarkar's Algorithm over a Sequence of Iterations. SIAM J. Optim. 1 (1) (1991)
Kurt M. Anstreicher
A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm. Math. Program. 47 (1990)
Kurt M. Anstreicher
A combined phase I-phase II projective algorithm for linear programming. Math. Program. 43 (1-3) (1989)
Kurt M. Anstreicher
The Worst-Case Step in Karmarkar's Algorithm. Math. Oper. Res. 14 (2) (1989)
Kurt M. Anstreicher
Linear programming and the newton barrier flow. Math. Program. 41 (1-3) (1988)
Kurt M. Anstreicher
A Monotonic Projective Algorithm for Fractional Linear Programming. Algorithmica 1 (4) (1986)