An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
type: Item
instance of: scholarly article
title: An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
zbMATH Open document ID: 1267.90160
author: Shu-Cherng Fang
author: Soon-Yi Wu
author: Liping Zhang
published in: Science China. Mathematics
publication date: 2013-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C34
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 93C62
zbMATH DE Number: 6137167
zbMATH Keywords: semi-infinite programming
zbMATH Keywords: min-max problem
zbMATH Keywords: central cutting plane
zbMATH Keywords: entropy
Wikidata QID: Q57429334
MaRDI profile type: Publication
full work available at URL: s11425-012-4502-z
OpenAlex ID: W1882110055
cites work: Penalty and Smoothing Methods for Convex Semi-Infinite Programming
cites work: A nonlinear programming approach to optimal design centering, tolerancing, and tuning
cites work: Q3690580
cites work: A central cutting plane algorithm for the convex programming problem
cites work: On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
cites work: Solving min-max problems and linear semi-infinite programs
cites work: Entropy optimization and mathematical programming
cites work: A smoothing approach for semi-infinite programming with projected Newton-type algorithm
cites work: Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
cites work: Q4357206
cites work: Q3858016
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
cites work: On the entropic regularization method for solving min-max problems with applications
cites work: On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
cites work: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
cites work: On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
cites work: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
cites work: Smoothing method for minimax problems
cites work: A New Exchange Method for Convex Semi-Infinite Programming
DOI: 10.1007/S11425-012-4502-Z
description: scientific article; zbMATH DE number 6137167