Equivalence of some quadratic programming algorithms
It is shown that the quadratic programming algorithms of Fletcher, Gill and Murray, Best and Ritter, and van de Panne and Whinston/Dantzig are special cases of a general algorithm for the solution of a convex (but not strictly convex) quadratic programming problem. The various algorithms are shown to differ only in the manner in which they solve the linear equations expressing the Kuhn-Tucker system. As a consequence all algorithms are shown to generate an identical sequence of points when starting from the same initial point. The paper extends the equivalence results of Goldfarb and Djang for the strictly positive definite case to the semi-definite quadratic programming problems.
- A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- A General Quadratic Programming Algorithm
- A quadratic programming algorithm using conjugate search directions
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
- An equivalence between two algorithms for quadratic programming
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3323071 (Why is no real title available?)
- Least-index resolution of degeneracy in quadratic programming
- Methods for Modifying Matrix Factorizations
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- New Finite Pivoting Rules for the Simplex Method
- Numerically stable methods for quadratic programming
- Quadratic Termination Properties of Minimization Algorithms I. Statement and Discussion of Results
- Simplicial decomposition in nonlinear programming algorithms
- The general quadratic optimization problem
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
- A constraint linearization method for nondifferentiable convex minimization
- Solution of projection problems over polytopes
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A note on weakly active constraints in connection with nonconvex quadratic programming
- Sensitivity analysis in isotonic regression
- An O(n^ 2) active set method for solving a certain parametric quadratic program
- An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
- An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
- Parallel decomposition of multistage stochastic programming problems
- Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming
- An equivalence result in linear-quadratic theory
- Finding normal solutions in piecewise linear programming
- Iterative schemes for the least 2-norm solution of piecewise linear programs
- Error analysis of an algorithm for equality-constrained quadratic programming problems
- Quadratic programming with transaction costs
- Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe
- An equivalence between two algorithms for a class of quadratic programming problems withmmatrices*
- A regularized decomposition method for minimizing a sum of polyhedral functions
- scientific article; zbMATH DE number 3968371 (Why is no real title available?)
- Quadratic programming analogs
- A quadratic programming algorithm
- scientific article; zbMATH DE number 4070204 (Why is no real title available?)
- scientific article; zbMATH DE number 4072720 (Why is no real title available?)
- scientific article; zbMATH DE number 4110462 (Why is no real title available?)
- Some generalizations of the criss-cross method for quadratic programming
- scientific article; zbMATH DE number 4118167 (Why is no real title available?)
- scientific article; zbMATH DE number 3894842 (Why is no real title available?)
- FUZZY MULTIPLE OBJECTIVE PROGRAMMING IN AN INTERVAL PIECEWISE REGRESSION MODEL
- INTERVAL PIECEWISE REGRESSION MODEL WITH AUTOMATIC CHANGE-POINT DETECTION BY QUADRATIC PROGRAMMING
- An equivalence between two algorithms for general quadratic programming
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Portfolio adjusting optimization with added assets and transaction costs based on credibility measures
- On the convergence properties of Hildreth's quadratic programming algorithm
- On duality for Boolean programming
- On the numerical realization of the exact penalty method for quadratic programming algorithms
- Active set algorithms for isotonic regression; a unifying framework
This page was built for publication: Equivalence of some quadratic programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3343781)