A projection and contraction method for convex quadratic programming

zbMATH Open0991.90097MaRDI QIDQ2719688

Pusheng Fei, Shefeng Zhao, Jian Li

Publication date: 25 June 2001

Published in: Journal of Wuhan University. Natural Science Edition (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items (10)

Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Box Constrained Quadratic Programming with Proportioning and Projections ⋮ The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints ⋮ Projection Methods in Conic Optimization ⋮ Contragredient transformations applied to the optimal projection equations ⋮ Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions ⋮ Title not available (Why is that?)

This page was built for publication: A projection and contraction method for convex quadratic programming

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