Pages that link to "Item:Q1361105"
From MaRDI portal
The following pages link to Long-step strategies in interior-point primal-dual methods (Q1361105):
Displaying 12 items.
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming (Q295450) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Parabolic target space and primal-dual interior-point methods (Q943845) (← links)
- Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (Q1294553) (← links)
- Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174) (← links)
- Computational experience with a modified potential reduction algorithm for linear programming (Q5200565) (← links)
- Towards non-symmetric conic optimization (Q5200566) (← links)
- Hessian distances and their applications in the complexity analysis of interior-point methods (Q5299911) (← links)
