Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming

DOI10.1007/S11766-999-0080-4zbMath0946.90097OpenAlexW2086283079MaRDI QIDQ1970753

Guoming Wu, Zhong-Ping Wan

Publication date: 21 March 2000

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-999-0080-4

zbMATH Keywords

convergencemaximum entropy methodsurrogate constraintdiscretization decomposition methodsemi-infinite minimax programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Semi-infinite programming (90C34) Decomposition methods (49M27)

Cites Work

• On the mixed Chinese postman problem
• Optimization theory and methods. Nonlinear programming
• On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming