Pages that link to "Item:Q3539793"
From MaRDI portal
The following pages link to An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints (Q3539793):
Displaying 3 items.
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones (Q1043012) (← links)
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function (Q1048238) (← links)
- Polynomial Solvability of Variants of the Trust-Region Subproblem (Q5383987) (← links)