Optimality analysis of a class of semi-infinite programming problems
DOI10.1007/S10957-020-01708-8zbMATH Open1450.90055OpenAlexW3039311790MaRDI QIDQ2194121FDOQ2194121
Authors: Zhiguo Feng, Fei Chen, Lin Chen, 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
Recommendations
Implicit function theorems, Jacobians, transformations with several variables (26B10) Fixed-point theorems (47H10) Semi-infinite programming (90C34)
Cites Work
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- A new exchange method for convex semi-infinite programming
- Semi-infinite programming, duality, discretization and optimality conditions†
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
- A smoothing approach for semi-infinite programming with projected Newton-type algorithm
- Feasible method for semi-infinite programs
- Performance limit of broadband beamformer designs in space and frequency
Cited In (5)
- Some recent results in parametric semi-infinite programming
- Title not available (Why is that?)
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- The search for optimal guaranteed solutions of high-dimensionality problems of semi-infinite programming
- Limit analysis for the optimal value of a class of minimax optimization problems
This page was built for publication: Optimality analysis of a class of semi-infinite programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194121)
