Pages that link to "Item:Q1106739"
From MaRDI portal
The following pages link to Generalization of Murty's direct algorithm to linear and convex quadratic programming (Q1106739):
Displayed 8 items.
- Relative difference in diversity between populations (Q688366) (← links)
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
- Norm-relaxed method of feasible directions for solving nonlinear programming problems (Q1338556) (← links)
- Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
- Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- The vertical linear complementarity problem associated with<i>P</i><sub>o</sub>-matrices (Q4700277) (← links)