The empirical performance of a polynomial algorithm for constrained nonlinear optimization

DOI10.1007/BF02025453zbMath0786.90066OpenAlexW2086856252MaRDI QIDQ1309871

Dorit S. Hochbaum, Sridhar Seshadri

Publication date: 6 January 1994

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02025453

zbMATH Keywords

polynomial algorithmsuccessive piecewise linear approximation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Complexity and algorithms for nonlinear optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• Computational aspects of two-segment separable programming
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Piecewise-linear programming: The compact (CPLP) algorithm
• Convex separable optimization is not much harder than linear optimization

This page was built for publication: The empirical performance of a polynomial algorithm for constrained nonlinear optimization