scientific article; zbMATH DE number 1526956

MaRDI QIDQ4513329zbMATH OpenFDO

Authors Shilu Tong, Xu Meng, Xiangxia Jing

Publication date 7 November 2000

zbMATH Keywords

computational complexityconvex quadratic programmingpath-following point algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4197754
• A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints
• scientific article; zbMATH DE number 4199975
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints

Cited in

(10)

• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
• A primal-dual infeasible interior point algorithm for a convex quadratic programming problem with box constraints
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
• scientific article; zbMATH DE number 4199975 (Why is no real title available?)
• scientific article; zbMATH DE number 724207 (Why is no real title available?)
• AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
• scientific article; zbMATH DE number 4197754 (Why is no real title available?)
• scientific article; zbMATH DE number 5063074 (Why is no real title available?)
• An interior point algorithm for convex quadratic programming with strict equilibrium constraints

This page was built for publication:

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