Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
type: Item
instance of: scholarly article
title: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
zbMATH Open document ID: 0931.90035
DOI: 10.1016/S0898-1221(99)00203-5
author: Soon-Yi Wu
author: Shu-Cherng Fang
publication date: 2000-01-20T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C48
zbMATH DE Number: 1391636
zbMATH Keywords: convex semi-infinite programming
zbMATH Keywords: cutting plane method
zbMATH Keywords: duality theory
MaRDI profile type: Publication
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Q3840143
cites work: Q3336266
cites work: Q5566063
cites work: Entropy optimization and mathematical programming
cites work: Numerical treatment of a class of semi‐infinite programming problems
cites work: Q3858016
cites work: A cutting-plane method for quadratic semi infinite programming problems
cites work: An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
cites work: Relaxed cutting plane method for solving linear semi-infinite programming problems
cites work: An inexact approach to solving linear semi-infinite programming problems
cites work: On solving convex quadratic semi-infinite programming probelms
cites work: Q3873909
cites work: On Linear Semi-Infinite Programming Problems: An Algorithm
full work available at URL: s0898-1221(99)00203-5
OpenAlex ID: W1971468044
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1391636