Characterization of Positive Definite and Semide Finite Matrices via Quadratic Programming Duality

DOI10.1137/0605005zbMath0536.90069OpenAlexW2048264266MaRDI QIDQ3321843

Shih-Ping Han, Olvi L. Mangasarian

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605005

zbMATH Keywords

positive definite matricesduality theorynonconvex quadratic programsdual quadratic programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Positive matrices and their generalizations; cones of matrices (15B48) Duality theory (optimization) (49N15)

Related Items

Primal-dual properties of sequential gradient-restoration algorithms for optimal control problems. II: General problem, On the numerical realization of the exact penalty method for quadratic programming algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Conjugate cone characterization of positive definite and semidefinite matrices
• Une caractérisation complete des minima locaux en programmation quadratique
• Duality in quadratic programming
• Local Duality of Nonlinear Programs
• A duality theorem for non-linear programming
• Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
• Necessary and sufficient conditions for quadratic minimality
• On Quadratic Programming