An interior Newton method for quadratic programming

DOI10.1007/S101070050069MaRDI QIDQ1586205zbMATH OpenOpenAlexFDO

Authors Thomas F. Coleman, Jianguo Liu

Publication date 12 November 2000

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/6166

zbMATH Keywords

Newton methodquadratic convergencenonconvex quadratic programmingtrust-region methoddogleg methodinterior method

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• A stable interior point method for convex quadratic programming
• Newton-KKT interior-point methods for indefinite quadratic programming
• scientific article; zbMATH DE number 1942620
• An exterior Newton method for strictly convex quadratic programming
• An interior point method for general large-scale quadratic programming problems

Cited in

(15)

• Higher-order derivatives in linear and quadratic programming
• IP from an SQP point of view
• scientific article; zbMATH DE number 1942620 (Why is no real title available?)
• A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
• A stable interior point method for convex quadratic programming
• A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
• A new linesearch method for quadratically constrained convex programming
• Copositive optimization -- recent developments and applications
• Newton-KKT interior-point methods for indefinite quadratic programming
• Quasi-Newton approaches to interior point methods for quadratic problems
• An exterior Newton method for strictly convex quadratic programming
• A New Practically Efficient Interior Point Method for Convex Quadratic Programming
• Newton-KKT interior-point methods for special linear complementarity problems
• A new full-Newton step feasible interior point method for convex quadratic programming
• An interior point method for general large-scale quadratic programming problems

This page was built for publication: An interior Newton method for quadratic programming

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