A projection cutting plane algorithm for convex programming problems
type: Item
instance of: scholarly article
title: A projection cutting plane algorithm for convex programming problems
zbMATH Open document ID: 0846.65025
DOI: 10.1016/0096-3003(95)00097-6
author: M. E. Primak
author: Daniel B. Szyld
published in: Applied Mathematics and Computation
publication date: 1996-06-23T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 892425
zbMATH Keywords: convex programming
zbMATH Keywords: cutting plane methods
zbMATH Keywords: complexity
zbMATH Keywords: projection cutting plane algorithm
MaRDI profile type: Publication
Wikidata QID: Q115156478
full work available at URL: 0096-3003(95)00097-6
OpenAlex ID: W1994263016
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Location of the Maximum on Unimodal Surfaces
cites work: Q4204004
cites work: Q3967357
cites work: Q5721624
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
cites work: Q4219308
description: scientific article; zbMATH DE number 892425