The empirical performance of a polynomial algorithm for constrained nonlinear optimization
type: Item
instance of: scholarly article
title: The empirical performance of a polynomial algorithm for constrained nonlinear optimization
zbMATH Open document ID: 0786.90066
DOI: 10.1007/BF02025453
author: Dorit S. Hochbaum
author: Sridhar Seshadri
published in: Annals of Operations Research
publication date: 1994-01-06T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 474765
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: successive piecewise linear approximation
MaRDI profile type: Publication
cites work: Q5583564
cites work: A simplex algorithm for piecewise-linear programming I: Derivation and proof
cites work: Convex separable optimization is not much harder than linear optimization
cites work: Computational aspects of two-segment separable programming
cites work: Piecewise-linear programming: The compact (CPLP) algorithm
cites work: Q3730336
cites work: A modification of Karmarkar's linear programming algorithm
cites work: Q5632367
cites work: Q4103334
full work available at URL: https://doi.org/10.1007/bf02025453
OpenAlex ID: W2086856252
description: scientific article; zbMATH DE number 474765