The following pages link to (Q4840104):
Displaying 8 items.
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme (Q2419534) (← links)