The complex interior-boundary method for linear and nonlinear programming with linear constraints

DOI10.1016/j.amc.2010.01.113zbMath1192.65082OpenAlexW2079260672MaRDI QIDQ979276

Camelia Al-Najjar, Behnam B. Malakooti

Publication date: 25 June 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.01.113

zbMATH Keywords

linear programmingcomparison of methodsnumerical examplesnonlinear programminginterior-point methodscomputational efficiencysimplex methodconvex programsinterior directioncomplex interior-boundary methodcomplex methodlinearly constrained pivotingreduced gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Exterior point simplex-type algorithms for linear and network optimization problems

Uses Software

• CONOPT
• MarPlex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infeasible (exterior point) simplex algorithm for assignment problems
• A note on ``An improved initial basis for the simplex algorithm
• Experiments with external pivoting
• Computational behavior of a feasible direction method for linear programming
• The simplex algorithm with a new primal and dual pivot rule
• Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
• A new efficient primal dual simplex algorithm
• A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
• A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
• An improved initial basis for the simplex algorithm
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Dealing with degeneracy in reduced gradient algorithms
• The Average number of pivot steps required by the Simplex-Method is polynomial
• Two direct methods in linear programming
• An efficient search direction for linear programming problems

This page was built for publication: The complex interior-boundary method for linear and nonlinear programming with linear constraints