Pages that link to "Item:Q990634"
From MaRDI portal
The following pages link to Extension of a projective interior point method for linearly constrained convex programming (Q990634):
Displaying 9 items.
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- Novel interior point algorithms for solving nonlinear convex optimization problems (Q1748456) (← links)
- On convex optimization with linear constraints (Q1905040) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization (Q2419510) (← links)
- An experimental approach to karmarkar’s projective method for linear programming (Q3773690) (← links)
- An extended projective formula and its application to semidefinite optimization (Q4902856) (← links)