New infeasible interior-point algorithm based on monomial method

DOI10.1016/0305-0548(95)00068-2MaRDI QIDQ1919774zbMATH OpenOpenAlexFDO

Authors Yi-Chih Hsieh, Dennis Bricker

Publication date 19 January 1997

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(95)00068-2

zbMATH Keywords

continuous quadratic knapsack problemsconvex linearly-constrained quadratic programminginfeasible path-following algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 1094157
• An infeasible interior-point algorithm for convex quadratic programming with full-Newton step
• scientific article; zbMATH DE number 1866539
• scientific article; zbMATH DE number 2091971
• An infeasible interior point method for convex quadratic problems

Cites work

• A monomial-based method for solving systems of non-linear algebraic equations
• A new polynomial-time algorithm for linear programming
• A new technique for generating quadratic programming test problems
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• A primal-dual infeasible-interior-point algorithm for linear programming
• Algorithms for the solution of quadratic knapsack problems
• An approach to nonlinear programming
• Convex quadratic programming with one constraint and bounded variables
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• Global convergence in infeasible-interior-point algorithms
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Path-Following Methods for Linear Programming
• Polynomiality of infeasible-interior-point algorithms for linear programming

Cited in

(1)

• scientific article; zbMATH DE number 1094157 (Why is no real title available?)

This page was built for publication: New infeasible interior-point algorithm based on monomial method

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