Steplengths in interior-point algorithms of quadratic programming

DOI10.1016/S0167-6377(99)00028-0MaRDI QIDQ1306349zbMATH OpenOpenAlexWikidataFDO

Authors Csaba Mészáros

Publication date 9 February 2001

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(99)00028-0

zbMATH Keywords

multiobjective optimizationefficient setconvex quadratic problemsinfeasible-interior-point primal-dual method

Mathematics Subject Classification ID

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

Recommendations

• Steplength selection in interior-point methods for quadratic programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• An infeasible interior-point algorithm for convex quadratic programming with full-Newton step
• Properties Of Primal Interior Point Methods For QP^∗
• scientific article; zbMATH DE number 679874

Cites work

• scientific article; zbMATH DE number 679857 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A primal-dual infeasible-interior-point algorithm for linear programming
• Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
• Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On superlinear convergence of infeasible interior-point algorithms for linearly constrained convex programs

Cited in

(8)

• Penalized spline support vector classifiers computational issues
• scientific article; zbMATH DE number 1873243 (Why is no real title available?)
• A generic kernel function for interior point methods
• Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
• A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
• Steplength selection in interior-point methods for quadratic programming
• Steplength selection in gradient projection methods for box-constrained quadratic programs

Describes a project that uses

Uses Software

• LOQO
• NETLIB LP Test Set

This page was built for publication: Steplengths in interior-point algorithms of quadratic programming

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