New infeasible interior-point algorithm based on monomial method

DOI10.1016/0305-0548(95)00068-2zbMath0854.90114OpenAlexW2054490583MaRDI QIDQ1919774

Dennis L. Bricker, Yi-Chieh Hsieh

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

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

Cites Work

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

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