Kurt M. Anstreicher

According to our database, Kurt M. Anstreicher authored at least 61 papers between 1986 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Solving Two-Trust-Region Subproblems Using Semidefinite Optimization with Eigenvector Branching.

Kurt M. Anstreicher

J. Optim. Theory Appl., July, 2024

2021

Quadratic optimization with switching variables: the convex hull for n=2.

Kurt M. Anstreicher, Samuel Burer

Math. Program., 2021

Convex hull representations for bounded products of variables.

Kurt M. Anstreicher, Samuel Burer, Kyungchan Park

J. Glob. Optim., 2021

2020

Efficient Solution of Maximum-Entropy Sampling Problems.

Kurt M. Anstreicher

Oper. Res., 2020

2018

Quadratic programs with hollows.

Boshi Yang, Kurt M. Anstreicher, Samuel Burer

Math. Program., 2018

Maximum-entropy sampling and the Boolean quadric polytope.

Kurt M. Anstreicher

J. Glob. Optim., 2018

2017

Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem.

Kurt M. Anstreicher

SIAM J. Optim., 2017

2013

Second-Order-Cone Constraints for Extended Trust-Region Subproblems.

Samuel Burer, Kurt M. Anstreicher

SIAM J. Optim., 2013

Separating doubly nonnegative and completely positive matrices.

Hongbo Dong, Kurt M. Anstreicher

Math. Program., 2013

Geometric conditions for Euclidean Steiner trees in ℜ^<i>d</i>.

Jon W. Van Laarhoven, Kurt M. Anstreicher

Comput. Geom., 2013

2012

Interior-point algorithms for a generalization of linear programming and weighted centring.

Kurt M. Anstreicher

Optim. Methods Softw., 2012

On convex relaxations for quadratically constrained quadratic programming.

Kurt M. Anstreicher

Math. Program., 2012

2010

Computable representations for convex hulls of low-dimensional quadratic forms.

Kurt M. Anstreicher, Samuel Burer

Math. Program., 2010

2009

Linear Programming: Karmarkar Projective Algorithm.

Kurt M. Anstreicher

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Linear Programming: Interior Point Methods.

Kurt M. Anstreicher

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Two "well-known" properties of subgradient optimization.

Kurt M. Anstreicher, Laurence A. Wolsey

Math. Program., 2009

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming.

Kurt M. Anstreicher

J. Glob. Optim., 2009

2008

Continuous optimization: 5th Brazilian workshop.

Kurt M. Anstreicher, Alfredo N. Iusem

Math. Program., 2008

An improved algorithm for computing Steiner minimal trees in Euclidean d-space.

Marcia Fampa, Kurt M. Anstreicher

Discret. Optim., 2008

2005

D.C. Versus Copositive Bounds for Standard QP.

Kurt M. Anstreicher, Samuel Burer

J. Glob. Optim., 2005

2004

The volumetric barrier for convex quadratic constraints.

Kurt M. Anstreicher

Math. Program., 2004

The Thirteen Spheres: A New Proof.

Kurt M. Anstreicher

Discret. Comput. Geom., 2004

The Steinberg Wiring Problem.

Nathan W. Brixius, Kurt M. Anstreicher

Proceedings of the Sharpest Cut, 2004

2003

Recent advances in the solution of quadratic assignment problems.

Kurt M. Anstreicher

Math. Program., 2003

2002

Improved Complexity for Maximum Volume Inscribed Ellipsoids.

Kurt M. Anstreicher

SIAM J. Optim., 2002

Solving large quadratic assignment problems on computational grids.

Kurt M. Anstreicher, Nathan W. Brixius, Jean-Pierre Goux, Jeff T. Linderoth

Math. Program., 2002

Improved Linear Programming Bounds for Antipodal Spherical Codes.

Kurt M. Anstreicher

Discret. Comput. Geom., 2002

2001

A new bound for the quadratic assignment problem based on convex quadratic programming.

Kurt M. Anstreicher, Nathan W. Brixius

Math. Program., 2001

Maximum-entropy remote sampling.

Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams

Discret. Appl. Math., 2001

2000

On Lagrangian Relaxation of Quadratic Matrix Constraints.

Kurt M. Anstreicher, Henry Wolkowicz

SIAM J. Matrix Anal. Appl., 2000

A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite.

Kurt M. Anstreicher, Margaret H. Wright

SIAM J. Optim., 2000

Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem.

Kurt M. Anstreicher

SIAM J. Optim., 2000

The Volumetric Barrier for Semidefinite Programming.

Kurt M. Anstreicher

Math. Oper. Res., 2000

1999

Linear Programming in O([n3/ln n]L) Operations.

Kurt M. Anstreicher

SIAM J. Optim., 1999

Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.

Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams

Math. Program., 1999

Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming.

Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye

Math. Oper. Res., 1999

Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier.

Kurt M. Anstreicher

Math. Oper. Res., 1999

1998

Towards a Practical Volumetric Cutting Plane Method for Convex Programming.

Kurt M. Anstreicher

SIAM J. Optim., 1998

1997

On Vaidya's Volumetric Cutting Plane Method for Convex Programming.

Kurt M. Anstreicher

Math. Oper. Res., 1997

1996

On Long Step Path Following and SUMT for Linear and Quadratic Programming.

Kurt M. Anstreicher

SIAM J. Optim., 1996

Volumetric path following algorithms for linear programming.

Kurt M. Anstreicher

Math. Program., 1996

Preface.

Kurt M. Anstreicher, Robert M. Freund

Ann. Oper. Res., 1996

Large step volumetric potential reduction algorithms for linear programming.

Kurt M. Anstreicher

Ann. Oper. Res., 1996

Continuous Relaxations for Constrained Maximum-Entropy Sampling.

Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

A New Infinity-Norm Path Following Algorithm for Linear Programming.

Kurt M. Anstreicher, Robert A. Bosch

SIAM J. Optim., 1995

1994

A Monotonic Build-Up Simplex Algorithm for Linear Programming.

Kurt M. Anstreicher, Tamás Terlaky

Oper. Res., 1994

1993

On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP.

Yinyu Ye, Kurt M. Anstreicher

Math. Program., 1993

Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming.

Kurt M. Anstreicher

Math. Program., 1993

A Family of Search Directions for Karmarkar's Algorithm.

Kurt M. Anstreicher, Patrick Watteyne

Oper. Res., 1993

On Partial Updating in a Potential Reduction Linear Programming Algorithm of Kojima, Mizuno, and Yoshise.

Robert A. Bosch, Kurt M. Anstreicher

Algorithmica, 1993

A Long-Step Barrier Method for Convex Quadratic Programming.

Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky

Algorithmica, 1993

1992

On interior algorithms for linear programming with no regularity assumptions.

Kurt M. Anstreicher

Oper. Res. Lett., 1992

Crashing a maximum-weight complementary basis.

Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford

Math. Program., 1992

Long steps in an O(n³L) algorithm for linear programming.

Kurt M. Anstreicher, Robert A. Bosch

Math. Program., 1992

1991

On the Performance of Karmarkar's Algorithm over a Sequence of Iterations.

Kurt M. Anstreicher

SIAM J. Optim., 1991

A combined phase I-phase II scaled potential algorithm for linear programming.

Kurt M. Anstreicher

Math. Program., 1991

1990

A Standard Form Variant, and Safeguarded Linesearch, for the Modified Karmarkar Algorithm.

Kurt M. Anstreicher

Math. Program., 1990

1989

A combined phase I-phase II projective algorithm for linear programming.

Kurt M. Anstreicher

Math. Program., 1989

The Worst-Case Step in Karmarkar's Algorithm.

Kurt M. Anstreicher

Math. Oper. Res., 1989

1988

Linear programming and the newton barrier flow.

Kurt M. Anstreicher

Math. Program., 1988

1986

A Monotonic Projective Algorithm for Fractional Linear Programming.

Kurt M. Anstreicher

Algorithmica, 1986