Kurt M. Anstreicher

Orcid: 0000-0002-6306-9940

According to our database¹, Kurt M. Anstreicher authored at least 60 papers between 1986 and 2021.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of four.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2021

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Samuel Burer

Math. Program., 2021

Convex hull representations for bounded products of variables.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Samuel Burer

Kyungchan Park

J. Glob. Optim., 2021

2020

Efficient Solution of Maximum-Entropy Sampling Problems.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Oper. Res., 2020

2018

Quadratic programs with hollows.

[BibT_eX]

[DOI]

Boshi Yang

Kurt M. Anstreicher

Samuel Burer

Math. Program., 2018

Maximum-entropy sampling and the Boolean quadric polytope.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

J. Glob. Optim., 2018

2017

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 2017

2013

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

[BibT_eX]

[DOI]

Samuel Burer

Kurt M. Anstreicher

SIAM J. Optim., 2013

Separating doubly nonnegative and completely positive matrices.

[BibT_eX]

[DOI]

Hongbo Dong

Kurt M. Anstreicher

Math. Program., 2013

Geometric conditions for Euclidean Steiner trees in ℜd.

[BibT_eX]

[DOI]

Jon W. Van Laarhoven

Kurt M. Anstreicher

Comput. Geom., 2013

2012

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Optim. Methods Softw., 2012

On convex relaxations for quadratically constrained quadratic programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 2012

2010

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Samuel Burer

Math. Program., 2010

2009

Linear Programming: Karmarkar Projective Algorithm.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Linear Programming: Interior Point Methods.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Two "well-known" properties of subgradient optimization.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Laurence A. Wolsey

Math. Program., 2009

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

J. Glob. Optim., 2009

2008

Continuous optimization: 5th Brazilian workshop.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Alfredo N. Iusem

Math. Program., 2008

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

[BibT_eX]

[DOI]

Marcia Fampa

Kurt M. Anstreicher

Discret. Optim., 2008

2005

D.C. Versus Copositive Bounds for Standard QP.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Samuel Burer

J. Glob. Optim., 2005

2004

The volumetric barrier for convex quadratic constraints.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 2004

The Thirteen Spheres: A New Proof.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Discret. Comput. Geom., 2004

The Steinberg Wiring Problem.

[BibT_eX]

[DOI]

Nathan W. Brixius

Kurt M. Anstreicher

Proceedings of the Sharpest Cut, 2004

2003

Recent advances in the solution of quadratic assignment problems.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 2003

2002

Improved Complexity for Maximum Volume Inscribed Ellipsoids.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 2002

Solving large quadratic assignment problems on computational grids.

[BibT_eX]

[DOI]

Math. Program., 2002

Improved Linear Programming Bounds for Antipodal Spherical Codes.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Discret. Comput. Geom., 2002

2001

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Nathan W. Brixius

Math. Program., 2001

Maximum-entropy remote sampling.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

On Lagrangian Relaxation of Quadratic Matrix Constraints.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Henry Wolkowicz

SIAM J. Matrix Anal. Appl., 2000

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Margaret H. Wright

SIAM J. Optim., 2000

Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 2000

The Volumetric Barrier for Semidefinite Programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Oper. Res., 2000

1999

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 1999

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

[BibT_eX]

[DOI]

Math. Program., 1999

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

[BibT_eX]

[DOI]

Math. Oper. Res., 1999

Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Oper. Res., 1999

1998

Towards a Practical Volumetric Cutting Plane Method for Convex Programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 1998

1997

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Oper. Res., 1997

1996

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 1996

Volumetric path following algorithms for linear programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 1996

Preface.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Robert M. Freund

Ann. Oper. Res., 1996

Large step volumetric potential reduction algorithms for linear programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Ann. Oper. Res., 1996

Continuous Relaxations for Constrained Maximum-Entropy Sampling.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Robert A. Bosch

SIAM J. Optim., 1995

1994

A Monotonic Build-Up Simplex Algorithm for Linear Programming.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Yinyu Ye

Kurt M. Anstreicher

Math. Program., 1993

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 1993

A Family of Search Directions for Karmarkar's Algorithm.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Patrick Watteyne

Oper. Res., 1993

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

[BibT_eX]

[DOI]

Robert A. Bosch

Kurt M. Anstreicher

Algorithmica, 1993

A Long-Step Barrier Method for Convex Quadratic Programming.

[BibT_eX]

[DOI]

Algorithmica, 1993

1992

On interior algorithms for linear programming with no regularity assumptions.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Oper. Res. Lett., 1992

Crashing a maximum-weight complementary basis.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Jon Lee

Thomas F. Rutherford

Math. Program., 1992

Long steps in an O(n3L) algorithm for linear programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Robert A. Bosch

Math. Program., 1992

1991

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

SIAM J. Optim., 1991

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 1991

1990

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 1990

1989

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

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 1989

The Worst-Case Step in Karmarkar's Algorithm.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Oper. Res., 1989

1988

Linear programming and the newton barrier flow.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Math. Program., 1988

1986

A Monotonic Projective Algorithm for Fractional Linear Programming.

[BibT_eX]

[DOI]

Kurt M. Anstreicher

Algorithmica, 1986

Kurt M. Anstreicher

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...