An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
From MaRDI portal
Publication:1935707
DOI10.1007/s11425-012-4502-zzbMath1267.90160OpenAlexW1882110055WikidataQ57429334 ScholiaQ57429334MaRDI QIDQ1935707
Shu-Cherng Fang, Soon-Yi Wu, Li-ping Zhang
Publication date: 19 February 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-012-4502-z
Applications of mathematical programming (90C90) Semi-infinite programming (90C34) Digital control/observation systems (93C62)
Related Items (2)
Non-convex semi-infinite min-max optimization with noncompact sets ⋮ A spline smoothing Newton method for semi-infinite minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- A smoothing approach for semi-infinite programming with projected Newton-type algorithm
- On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
- On the entropic regularization method for solving min-max problems with applications
- Entropy optimization and mathematical programming
- Solving min-max problems and linear semi-infinite programs
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Penalty and Smoothing Methods for Convex Semi-Infinite Programming
- A central cutting plane algorithm for the convex programming problem
- A nonlinear programming approach to optimal design centering, tolerancing, and tuning
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Smoothing method for minimax problems
This page was built for publication: An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
