A new computational method for the functional inequality constrained minimax optimization problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1054761
- Computational discretization algorithms for functional inequality constrained optimization
- A simple computational procedure for optimization problems with functional inequality constraints
- An objective penalty function-based method for inequality constrained minimization problem
Cites work
- scientific article; zbMATH DE number 50941 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A computational algorithm for functional inequality constrained optimization problems
- A constrained H∞ smooth optimization technique
- Alternative algorithms for solving nonlinear function and functional inequalities
- 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
- On Smoothing Exact Penalty Functions for Convex Constrained Optimization
- Smooth Optimization Methods for Minimax Problems
Cited in
(2)
This page was built for publication: A new computational method for the functional inequality constrained minimax optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356866)
