Kurt M. Anstreicher

According to our database1, Kurt M. Anstreicher authored at least 58 papers between 1986 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Efficient Solution of Maximum-Entropy Sampling Problems.
Oper. Res., 2020

2018
Quadratic programs with hollows.
Math. Program., 2018

Maximum-entropy sampling and the Boolean quadric polytope.
J. Glob. Optim., 2018

2017
Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem.
SIAM J. Optim., 2017

2013
Second-Order-Cone Constraints for Extended Trust-Region Subproblems.
SIAM J. Optim., 2013

Separating doubly nonnegative and completely positive matrices.
Math. Program., 2013

Geometric conditions for Euclidean Steiner trees in ℜ<sup><i>d</i></sup>.
Comput. Geom., 2013

2012
Interior-point algorithms for a generalization of linear programming and weighted centring.
Optim. Methods Softw., 2012

On convex relaxations for quadratically constrained quadratic programming.
Math. Program., 2012

2010
Computable representations for convex hulls of low-dimensional quadratic forms.
Math. Program., 2010

2009
Linear Programming: Karmarkar Projective Algorithm.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Linear Programming: Interior Point Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Two "well-known" properties of subgradient optimization.
Math. Program., 2009

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming.
J. Glob. Optim., 2009

2008
Continuous optimization: 5th Brazilian workshop.
Math. Program., 2008

An improved algorithm for computing Steiner minimal trees in Euclidean d-space.
Discret. Optim., 2008

2005
D.C. Versus Copositive Bounds for Standard QP.
J. Glob. Optim., 2005

2004
The volumetric barrier for convex quadratic constraints.
Math. Program., 2004

The Thirteen Spheres: A New Proof.
Discret. Comput. Geom., 2004

The Steinberg Wiring Problem.
Proceedings of the Sharpest Cut, 2004

2003
Recent advances in the solution of quadratic assignment problems.
Math. Program., 2003

2002
Improved Complexity for Maximum Volume Inscribed Ellipsoids.
SIAM J. Optim., 2002

Solving large quadratic assignment problems on computational grids.
Math. Program., 2002

Improved Linear Programming Bounds for Antipodal Spherical Codes.
Discret. Comput. Geom., 2002

2001
A new bound for the quadratic assignment problem based on convex quadratic programming.
Math. Program., 2001

Maximum-entropy remote sampling.
Discret. Appl. Math., 2001

2000
On Lagrangian Relaxation of Quadratic Matrix Constraints.
SIAM J. Matrix Anal. Appl., 2000

A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite.
SIAM J. Optim., 2000

Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem.
SIAM J. Optim., 2000

The Volumetric Barrier for Semidefinite Programming.
Math. Oper. Res., 2000

1999
Linear Programming in O([n3/ln n]L) Operations.
SIAM J. Optim., 1999

Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems.
Math. Program., 1999

Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming.
Math. Oper. Res., 1999

Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier.
Math. Oper. Res., 1999

1998
Towards a Practical Volumetric Cutting Plane Method for Convex Programming.
SIAM J. Optim., 1998

1997
On Vaidya's Volumetric Cutting Plane Method for Convex Programming.
Math. Oper. Res., 1997

1996
On Long Step Path Following and SUMT for Linear and Quadratic Programming.
SIAM J. Optim., 1996

Volumetric path following algorithms for linear programming.
Math. Program., 1996

Preface.
Ann. Oper. Res., 1996

Large step volumetric potential reduction algorithms for linear programming.
Ann. Oper. Res., 1996

Continuous Relaxations for Constrained Maximum-Entropy Sampling.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

1995
A New Infinity-Norm Path Following Algorithm for Linear Programming.
SIAM J. Optim., 1995

1994
A Monotonic Build-Up Simplex Algorithm for Linear Programming.
Oper. Res., 1994

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

Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming.
Math. Program., 1993

A Family of Search Directions for Karmarkar's Algorithm.
Oper. Res., 1993

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

A Long-Step Barrier Method for Convex Quadratic Programming.
Algorithmica, 1993

1992
On interior algorithms for linear programming with no regularity assumptions.
Oper. Res. Lett., 1992

Crashing a maximum-weight complementary basis.
Math. Program., 1992

Long steps in an O(n<sup>3</sup>L) algorithm for linear programming.
Math. Program., 1992

1991
On the Performance of Karmarkar's Algorithm over a Sequence of Iterations.
SIAM J. Optim., 1991

A combined phase I-phase II scaled potential algorithm for linear programming.
Math. Program., 1991

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

1989
A combined phase I-phase II projective algorithm for linear programming.
Math. Program., 1989

The Worst-Case Step in Karmarkar's Algorithm.
Math. Oper. Res., 1989

1988
Linear programming and the newton barrier flow.
Math. Program., 1988

1986
A Monotonic Projective Algorithm for Fractional Linear Programming.
Algorithmica, 1986


  Loading...