The following pages link to E. D. Andersen (Q211250):
Displaying 20 items.
- A computational study of the homogeneous algorithm for large-scale convex optimization (Q1273428) (← links)
- Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach (Q1294549) (← links)
- (Q1411640) (redirect page) (← links)
- On implementing a primal-dual interior-point method for conic quadratic optimization (Q1411641) (← links)
- On a homogeneous algorithm for the monotone complementarity problem (Q1572684) (← links)
- Presolving in linear programming (Q1914076) (← links)
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
- On primal and dual infeasibility certificates in a homogeneous model for convex optimization (Q2706334) (← links)
- A homogenized cutting plane method to solve the convex feasibility problem. (Q2735076) (← links)
- (Q4347846) (← links)
- (Q4353528) (← links)
- Combining Interior-Point and Pivoting Algorithms for Linear Programming (Q4361490) (← links)
- On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming (Q4427366) (← links)
- (Q4496016) (← links)
- Notes on Duality in Second Order and p -Order Cone Optimization (Q4804983) (← links)
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
- Certificates of primal or dual infeasibility in linear programming (Q5947149) (← links)
- Computing conjugate barrier information for nonsymmetric cones (Q6388002) (← links)
- Computing conjugate barrier information for nonsymmetric cones (Q6596336) (← links)
