A numerically stable dual method for solving strictly convex quadratic programs

@article{Goldfarb1983ANS,
  title={A numerically stable dual method for solving strictly convex quadratic programs},
  author={Donald Goldfarb and Ashok U. Idnani},
  journal={Mathematical Programming},
  year={1983},
  volume={27},
  pages={1-33}
}
  • D. Goldfarb, A. Idnani
  • Published 1 September 1983
  • Mathematics, Computer Science
  • Mathematical Programming
An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage of the fact that the unconstrained minimum of the objective function can be used as a starting point. Its implementation utilizes the Cholesky and QR factorizations and procedures for updating them. The performance of the dual algorithm is compared against that of primal algorithms when used to solve randomly generated test problems and quadratic programs generated… 
Numerical Algorithms for Sequential Quadratic Optimization
This thesis investigates numerical algorithms for sequential quadratic programming (SQP). SQP algorithms are used for solving nonlinear programs, i.e. mathmatical optimization problems with nonlinear
A numerically stable least squares solution to the quadratic programming problem
The strictly convex quadratic programming problem is transformed to the least distance problem finding the solution of minimum norm to the system of linear inequalities. This problem is equivalent to
A numerically stable least squares solution to the quadratic programming problem
The strictly convex quadratic programming problem is transformed to the least distance problem — finding the solution of minimum norm to the system of linear inequalities. This problem is equivalent
A Primal-Dual Active-Set Method for Convex Quadratic Programming
TLDR
The paper deals with a method for solving general convex quad ratic programming problems with equality and inequality constraints and shows that the method is effective on problems wi th many box constraints and range inequalities.
A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
In this paper we propose a new iterative method for solving a class of linear complementarity problems:u ≥ 0,Mu + q ≥ 0, uT(Mu + q)=0, where M is a givenl ×l positive semidefinite matrix (not
A dual gradient-projection method for large-scale strictly convex quadratic problems
TLDR
The details of a solver for minimizing a strictly convex quadratic objective function subject to general linear constraints are presented and how the linear algebra may be arranged to take computational advantage of sparsity in the second-derivative matrix is shown.
Efficient primal algorithms for strictly convex quadratic programs
Two active set primal simplex algorithms for solving strictly convex quadratic programs are presented which, in their implementation, are closely related to the dual algorithm of Goldfarb and Idnani.
Active-set methods for convex quadratic programming
Computational methods are proposed for solving a convex quadratic program (QP). Active-set methods are defined for a particular primal and dual formulation of a QP with general equality constraints
Implementation of a robust SQP algorithm
  • B. Fabien
  • Computer Science
    Optim. Methods Softw.
  • 2008
TLDR
The robustness of the SQP algorithm is demonstrated via a C language implementation that is applied to numerous parameter optimization and optimal control problems that have appeared in the literature and can significantly reduce the amount of work required to solve parameter optimization problems.
...
...

References

SHOWING 1-10 OF 50 REFERENCES
Numerically stable dual projection methods for solving positive definite quadratic programs
TLDR
Tests on the use of this numerically stable DP method in Powell's algorithm on six published NLP problems produced a 45 to 70 percent reduction in the computational effort over that required by Fletcher's QP algorithm.
A Parametric Method for Semidefinite Quadratic Programs
A parametric method for solving semidefinite quadratic programs with a large number of constraints is described. All computations are performed by pivotal operations on a tableau, or more efficiently
A Method of Solution for Quadratic Programs
This paper describes a method of minimizing a strictly convex quadratic functional of several variables constrained by a system of linear inequalities. The method takes advantage of strict convexity
The Simplex and the Dual Method for Quadratic Programming
The paper presents a straightforward generalization of the Simplex and the dual method for linear programming to the case of convex quadratic programming. The two algorithms, called the Simplex and
Numerically stable methods for quadratic programming
TLDR
A new algorithm is described for indefinite quadratic programming which utilizes methods for updating positivedefinite factorizations only and can be used for the positive-definite case without loss of efficiency.
A stable method for solving certain constrained least squares problems
  • R. Mifflin
  • Mathematics, Computer Science
    Math. Program.
  • 1979
TLDR
The algorithm generates a finite sequence of subproblems that are solved using the numerically stable technique of orthogonal factorization with reorthogonalization and Given's transformation updating.
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
more constraints or equations, with either a linear or nonlinear objective function. This distinction is made primarily on the basis of the difficulty of solving these two types of nonlinear
ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES
SUMMARY THE minimization of a convex function of variables subject to linear inequalities is discussed briefly in general terms. Dantzig's Simplex Method is extended to yield finite algorithms for
On the Numerical Solution of Constrained Least-Squares Problems
This article presents a numerically stable algorithm for solving linear least-squares problems with linear equalities and inequalities as additional constraints. The method proposed is a method of
...
...