A new quadratic semi-infinite programming algorithm based on dual parametrization
From MaRDI portal
Publication:557361
DOI10.1023/B:JOGO.0000047910.80739.95zbMath1083.90042OpenAlexW1964806748MaRDI QIDQ557361
Kok Lay Teo, Soon-Yi Wu, Yanqun Liu
Publication date: 23 June 2005
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jogo.0000047910.80739.95
Related Items (10)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ A review of recent advances in global optimization ⋮ Some properties on quadratic infinite programs of integral type ⋮ A ladder method for linear semi-infinite programming ⋮ A dual parametrization approach to Nyquist filter design ⋮ Numerical method for a class of optimal control problems subject to nonsmooth functional constraints ⋮ Learning Data Manifolds with a Cutting Plane Method ⋮ Semi-infinite quadratic optimization method using dual parametrization with application to antenna array ⋮ A new adaptive method to nonlinear semi-infinite programming ⋮ An inexact primal-dual algorithm for semi-infinite programming
This page was built for publication: A new quadratic semi-infinite programming algorithm based on dual parametrization
