Pages that link to "Item:Q3976933"
From MaRDI portal
The following pages link to A Polynomial Method of Weighted Centers for Convex Quadratic Programming (Q3976933):
Displaying 11 items.
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm (Q688920) (← links)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- A survey of search directions in interior point methods for linear programming (Q1181912) (← links)
- The linear complementarity problem, sufficient matrices, and the criss- cross method (Q1260955) (← links)
- Modified predictor-corrector algorithm for locating weighted centers in linear programming (Q1321467) (← links)
- On weighted centers for semidefinite programming (Q1584796) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs (Q3971871) (← links)
- Solving LP Problems via Weighted Centers (Q4717550) (← links)
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA (Q5113061) (← links)
- An efficient DCA algorithm for solving non-monotone affine variational inequality problem (Q6657973) (← links)