The following pages link to Kurt M. Anstreicher (Q170436):
Displaying 21 items.
- Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem (Q2968177) (← links)
- (Q3351138) (← links)
- The Worst-Case Step in Karmarkar's Algorithm (Q3829348) (← links)
- On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations (Q4017636) (← links)
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming (Q4229486) (← links)
- A Family of Search Directions for Karmarkar's Algorithm (Q4272899) (← links)
- A Monotonic Build-Up Simplex Algorithm for Linear Programming (Q4305758) (← links)
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming (Q4339373) (← links)
- (Q4347844) (← links)
- (Q4400646) (← links)
- Continuous relaxations for Constrained Maximum-Entropy Sampling (Q4645926) (← links)
- Linear Programming in O([n3/ln n]L) Operations (Q4702310) (← links)
- Improved Complexity for Maximum Volume Inscribed Ellipsoids (Q4785883) (← links)
- A New Infinity-Norm Path Following Algorithm for Linear Programming (Q4838954) (← links)
- On Long Step Path Following and SUMT for Linear and Quadratic Programming (Q4877504) (← links)
- Efficient Solution of Maximum-Entropy Sampling Problems (Q5144798) (← links)
- Interior-point algorithms for a generalization of linear programming and weighted centring (Q5200552) (← links)
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems (Q5300533) (← links)
- (Q5465122) (← links)
- Maximum-entropy remote sampling (Q5929307) (← links)
- A new bound for the quadratic assignment problem based on convex quadratic programming (Q5930731) (← links)
