A new computational method for the functional inequality constrained minimax optimization problem

DOI10.1016/S0898-1221(97)00031-XzbMath0872.65053OpenAlexW1981361474MaRDI QIDQ1356866

Kok Lay Teo, Wei-Yong Yan, Dan-chi Jiang

Publication date: 3 August 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00031-x

zbMATH Keywords

numerical exampleserror boundsemi-infinite programmingsmoothing functionminimax optimization problemsfunctional inequality constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34)

Cites Work

• Unnamed Item
• Unnamed Item
• A computational algorithm for functional inequality constrained optimization problems
• Convergence rate for an approximation approach to \(H_ \infty\)-norm optimization problems with an application to controller order reduction
• Nonmonotone line search for minimax problems
• Alternative algorithms for solving nonlinear function and functional inequalities
• Smooth Optimization Methods for Minimax Problems
• A constrained H^∞ smooth optimization technique
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization