An accelerated central cutting plane algorithm for linear semi-infinite programming
type: Item
instance of: scholarly article
title: An accelerated central cutting plane algorithm for linear semi-infinite programming
zbMATH Open document ID: 1073.90053
author: Bruno Betrò
published in: Mathematical Programming. Series A. Series B
publication date: 2005-02-24T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 2138195
describes a project that uses: PROFIL/BIAS
MaRDI profile type: Publication
full work available at URL: s10107-003-0492-5
OpenAlex ID: W2101508998
cites work: Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
cites work: Methods for Global Prior Robustness under Generalized Moment Conditions
cites work: A logarithmic barrier cutting plane method for convex programming
cites work: A central cutting plane algorithm for the convex programming problem
cites work: Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
cites work: Q4357206
cites work: A one-phase algorithm for semi-infinite linear programming
cites work: Q4847666
cites work: Q3840146
cites work: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
cites work: A purification algorithm for semi-infinite programming
cites work: Design of optimal linear phase FIR filters by a semi-infinite programming technique
cites work: Q3840143
DOI: 10.1007/S10107-003-0492-5
description: scientific article; zbMATH DE number 2138195