Pages that link to "Item:Q3640925"
From MaRDI portal
The following pages link to A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization (Q3640925):
Displaying 4 items.
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738) (← links)
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization (Q2218879) (← links)
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659) (← links)
