An \(\epsilon\)-active barrier-function method for solving minimax problems
From MaRDI portal
Publication:806678
DOI10.1007/BF01442402zbMath0729.90074OpenAlexW2091373693MaRDI QIDQ806678
Publication date: 1991
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01442402
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Semi-infinite programming (90C34) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Algorithms with adaptive smoothing for finite minimax problems, Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- An algorithm for composite nonsmooth optimization problems
- A comparative study of several semi-infinite nonlinear programming algorithms
- Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
- Minimization of functions having Lipschitz continuous first partial derivatives
- A method of feasible directions using function approximations, with applications to min max problems
- Optimization and nonsmooth analysis
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- On the design of stabilizing compensators via semi-infinite optimization
- Combined lp and quasi-Newton methods for minimax optimization
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- An Efficient Method to Solve the Minimax Problem Directly
- Minimal Topological Spaces
