Pages that link to "Item:Q747738"
From MaRDI portal
The following pages link to Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738):
Displaying 4 items.
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879) (← links)
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems (Q2311198) (← links)
- An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones (Q2361596) (← links)
- Path-following interior-point algorithm for monotone linear complementarity problems (Q5876796) (← links)
