A computational method for the indefinite quadratic programming problem

DOI10.1016/0024-3795(80)90172-XMaRDI QIDQ1158735zbMATH OpenWikidataFDO

Authors James R. Bunch, Linda Kaufman

Publication date 1980

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(80)90172-X

zbMATH Keywords

indefinite quadratic programminglocal minimumnumerical examplestable decomposition of a symmetric matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites work

• A modified Newton method for minimization
• Analysis of the Diagonal Pivoting Method
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• scientific article; zbMATH DE number 3825682 (Why is no real title available?)
• scientific article; zbMATH DE number 51949 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• Methods for Modifying Matrix Factorizations
• Numerically stable methods for quadratic programming
• On the reduction of a symmetric matrix to tridiagonal form
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems

Cited in

(13)

• A note on weakly active constraints in connection with nonconvex quadratic programming
• Fault diagnosis in condition of sample type incompleteness using support vector data description
• Fault isolation for nonlinear systems using flexible support vector regression
• Methods for convex and general quadratic programming
• Sparse quadratic programming in chemical process optimization
• Adaptive tetrahedral meshing in free-surface flow
• Primal and dual active-set methods for convex quadratic programming
• A weighted gram-schmidt method for convex quadratic programming
• On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
• Optimization of a nonlinear Hermitian matrix expression with application
• A numerically stable dual method for solving strictly convex quadratic programs
• Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method
• On the numerical realization of the exact penalty method for quadratic programming algorithms

This page was built for publication: A computational method for the indefinite quadratic programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158735)