Numerically stable methods for quadratic programming
From MaRDI portal
Publication:4152038
DOI10.1007/BF01588976zbMath0374.90054MaRDI QIDQ4152038
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
90C20: Quadratic programming
Related Items
INTERVAL PIECEWISE REGRESSION MODEL WITH AUTOMATIC CHANGE-POINT DETECTION BY QUADRATIC PROGRAMMING, A numerically stable dual method for solving strictly convex quadratic programs, A direct active set algorithm for large sparse quadratic programs with simple bounds, A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming, On the numerical realization of the exact penalty method for quadratic programming algorithms, Solving the minimal least squares problem subject to bounds on the variables, Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems, An algorithm for composite nonsmooth optimization problems, Experiments with successive quadratic programming algorithms, A computational method for the indefinite quadratic programming problem, 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, Computation of a trust region step, A practical anti-cycling procedure for linearly constrained optimization, An SQP method for general nonlinear programs using only equality constrained subproblems, A new technique for inconsistent QP problems in the SQP method, Constraint deletion strategy in the inertia-controlling quadratic programming method, Sparse quadratic programming in chemical process optimization, A weighted gram-schmidt method for convex quadratic programming, Equivalence of some quadratic programming algorithms, Optimization over the efficient set using an active constraint approach, On the superlinear convergence of a trust region algorithm for nonsmooth optimization, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, A regularized decomposition method for minimizing a sum of polyhedral functions, ImplementableL∞penalty-function method for semi-infinite optimization, Avoiding Modified Matrix Factorizations in Newton-like Methods, The computation of Lagrange-multiplier estimates for constrained minimization, On solving a primal geometric program by partial dual optimization, A method to increase the computational efficiency of certain quadratic programming algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- The computation of Lagrange-multiplier estimates for constrained minimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Methods for Modifying Matrix Factorizations
- Constrained Optimization Using a Nondifferentiable Penalty Function
