The Symmetric Formulation of the Simplex Method for Quadratic Programming
From MaRDI portal
Publication:5575232
Cited in
(13)- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- An algorithm for portfolio optimization with variable transaction costs. II: Computational analysis
- Some generalizations of the criss-cross method for quadratic programming
- A strictly improving linear programming Phase I algorithm
- On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
- Least-index resolution of degeneracy in quadratic programming
- An equivalence between two algorithms for quadratic programming
- Equivalence of some quadratic programming algorithms
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- A unified approach to one-parametric general quadratic programming
- The general quadratic optimization problem
This page was built for publication: The Symmetric Formulation of the Simplex Method for Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5575232)
