A smoothing approach for semi-infinite programming with projected Newton-type algorithm
From MaRDI portal
Publication:1013456
DOI10.3934/JIMO.2009.5.141zbMath1158.90409OpenAlexW2048473411MaRDI QIDQ1013456
Volker Rehbock, Zhi Guo Feng, Kok Lay Teo
Publication date: 20 April 2009
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2009.5.141
Related Items (4)
An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ Optimality analysis of a class of semi-infinite programming problems ⋮ Control variable parameterisation with penalty approach for hypersonic vehicle reentry optimisation ⋮ A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
This page was built for publication: A smoothing approach for semi-infinite programming with projected Newton-type algorithm
