Kurt M. Anstreicher

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