Pages that link to "Item:Q1252156"
From MaRDI portal
The following pages link to A feasible direction algorithm for convex optimization: Global convergence rates (Q1252156):
Displaying 5 items.
- A base reduction method for convex programming (Q917445) (← links)
- A class of superlinearly convergent projection algorithms with relaxed stepsizes (Q1057626) (← links)
- Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
- Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
- Optimal control of systems described by delay differential equations (Q3941280) (← links)
