Pages that link to "Item:Q5317840"
From MaRDI portal
The following pages link to A combination of potential reduction steps and steepest descent steps for solving convex programming problems (Q5317840):
Displaying 3 items.
- An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
- A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems (Q5492637) (← links)
- A potential reduction algorithm for linearly constrained convex programming (Q5953365) (← links)