Optimality analysis of a class of semi-infinite programming problems

DOI10.1007/s10957-020-01708-8zbMath1450.90055OpenAlexW3039311790MaRDI QIDQ2194121

Fei Chen, Lin Chen, Zhi Guo Feng, Ka-Fai Cedric Yiu

Publication date: 25 August 2020

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-020-01708-8

zbMATH Keywords

semi-infinite programmingfixed-point theoremfilter designbeamformer design

Mathematics Subject Classification ID

Fixed-point theorems (47H10) Semi-infinite programming (90C34) Implicit function theorems, Jacobians, transformations with several variables (26B10)

Cites Work

• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
• Semi-infinite programming
• A smoothing approach for semi-infinite programming with projected Newton-type algorithm
• Performance limit of broadband beamformer designs in space and frequency
• A New Exchange Method for Convex Semi-Infinite Programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• Feasible Method for Semi-Infinite Programs
• Semi-infinite programming, duality, discretization and optimality conditions†

This page was built for publication: Optimality analysis of a class of semi-infinite programming problems