The following pages link to Kurt M. Anstreicher (Q170436):
Displaying 50 items.
- A monotonic projective algorithm for fractional linear programming (Q580191) (← links)
- (Q689100) (redirect page) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- On monotonicity in the scaled potential algorithm for linear programming (Q805164) (← links)
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices (Q840651) (← links)
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm (Q920840) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- (Q984865) (redirect page) (← links)
- A note on ``\(5\times 5\) completely positive matrices'' (Q984866) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700) (← links)
- A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm (Q1089251) (← links)
- Linear programming and the Newton barrier flow (Q1111465) (← links)
- A combined phase I-phase II projective algorithm for linear programming (Q1114588) (← links)
- A combined phase I-phase II scaled potential algorithm for linear programming (Q1181908) (← links)
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming (Q1196717) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- On interior algorithms for linear programming with no regularity assumptions (Q1197904) (← links)
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise (Q1206441) (← links)
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems (Q1300266) (← links)
- Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming (Q1319021) (← links)
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP (Q1319022) (← links)
- Volumetric path following algorithms for linear programming (Q1361113) (← links)
- Recent advances in the solution of quadratic assignment problems (Q1403282) (← links)
- Improved linear programming bounds for antipodal spherical codes. (Q1611074) (← links)
- Quadratic programs with hollows (Q1659682) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse (Q1819538) (← links)
- Solving large quadratic assignment problems on computational grids (Q1849534) (← links)
- The volumetric barrier for convex quadratic constraints (Q1885279) (← links)
- The thirteen spheres: a new proof (Q1889917) (← links)
- Large step volumetric potential reduction algorithms for linear programming (Q1915924) (← links)
- On convex relaxations for quadratically constrained quadratic programming (Q1925792) (← links)
- Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\) (Q1941216) (← links)
- Separating doubly nonnegative and completely positive matrices (Q1942269) (← links)
- Strong duality for a trust-region type relaxation of the quadratic assignment problem (Q1970512) (← links)
- Quadratic optimization with switching variables: the convex hull for \(n=2\) (Q2044962) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Testing copositivity via mixed-integer linear programming (Q2226458) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Computable representations for convex hulls of low-dimensional quadratic forms (Q2638365) (← links)
- On Lagrangian Relaxation of Quadratic Matrix Constraints (Q2706239) (← links)
- A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite (Q2706326) (← links)
- Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem (Q2706327) (← links)
- (Q2743961) (← links)
- Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming (Q2757589) (← links)
- Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier (Q2757590) (← links)
- The Volumetric Barrier for Semidefinite Programming (Q2757641) (← links)
- Solving quadratic assignment problems using convex quadratic programming relaxations (Q2774598) (← links)
- An Approach to the Dodecahedral Conjecture Based on Bounds for Spherical Codes (Q2848990) (← links)
