Pages that link to "Item:Q4697086"
From MaRDI portal
The following pages link to A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems (Q4697086):
Displaying 10 items.
- Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
- Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
- Controlled dual perturbations for central path trajectories in geometric programming (Q1328646) (← links)
- A globally convergent primal-dual interior point algorithm for convex programming (Q1330897) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Modified primal path-following scheme for the monotone variational inequality problem (Q1372549) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- A polynomial time infeasible interior-point arc-search algorithm for convex optimization (Q6173777) (← links)
