The empirical performance of a polynomial algorithm for constrained nonlinear optimization

DOI10.1007/BF02025453MaRDI QIDQ1309871zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Convex separable optimization is not much harder than linear optimization
• scientific article; zbMATH DE number 269555
• scientific article; zbMATH DE number 2201985
• On some efficient interior point methods for nonlinear convex programming
• An algorithm for linearly constrained convex nondifferentiable minimization problems

Cites work

• A modification of Karmarkar's linear programming algorithm
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Computational aspects of two-segment separable programming
• Convex separable optimization is not much harder than linear optimization
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 3526459 (Why is no real title available?)
• scientific article; zbMATH DE number 3301975 (Why is no real title available?)
• scientific article; zbMATH DE number 3358258 (Why is no real title available?)
• Piecewise-linear programming: The compact (CPLP) algorithm

Cited in

(2)

• Complexity and algorithms for nonlinear optimization problems
• scientific article; zbMATH DE number 891154 (Why is no real title available?)

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

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