Pages that link to "Item:Q5575232"
From MaRDI portal
The following pages link to The Symmetric Formulation of the Simplex Method for Quadratic Programming (Q5575232):
Displaying 13 items.
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029) (← links)
- A strictly improving linear programming Phase I algorithm (Q1312775) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (Q2076907) (← links)
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis (Q2483030) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- A unified approach to one-parametric general quadratic programming (Q3703660) (← links)
- An equivalence between two algorithms for quadratic programming (Q3895232) (← links)
- Least-index resolution of degeneracy in quadratic programming (Q3902831) (← links)
- On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft (Q4051875) (← links)
- Some generalizations of the criss-cross method for quadratic programming (Q4327908) (← links)
- The general quadratic optimization problem (Q4401736) (← links)
