The following pages link to Benjamin Jansen (Q1278288):
Displaying 13 items.
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid (Q1278289) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- (Q1337203) (redirect page) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Interior point techniques in optimization. Complementarity, sensitivity and algorithms (Q1353364) (← links)
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (Q1361107) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Operational planning of a large-scale multi-modal transportation system. (Q1426685) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- Basis- and partition identification for quadratic programming and linear complementarity problems (Q1961979) (← links)
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems (Q3124039) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming (Q4895562) (← links)
