An approximation approach to non-strictly convex quadratic semi-infinite programming

DOI10.1007/s10898-004-8278-8zbMath1066.90130OpenAlexW2051458578MaRDI QIDQ1777448

Satoshi Ito, Yanqun Liu, Kok Lay Teo

Publication date: 17 May 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-8278-8

zbMATH Keywords

semi-infinite programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Semi-infinite programming (90C34)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization. Algorithms and consistent approximations
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Semi-Infinite Programming: Theory, Methods, and Applications
• A dual parameterization approach to linear-quadratic semi-infinite programming problems
• On solving convex quadratic semi-infinite programming probelms
• A dual parametrization method for convex semi-infinite programming
• Semi-infinite programming approach to continuously-constrained linear-quadratic optimal control problems