An interior point algorithm for computing saddle points of constrained continuous minimax

DOI10.1023/A:1019284715657zbMath0977.49015OpenAlexW181977852MaRDI QIDQ5933829

Costas Pantelides, Berc Rustem, Stanislav Zakovic

Publication date: 14 June 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019284715657

zbMATH Keywords

constrained optimizationinterior point methodssaddle points

Mathematics Subject Classification ID

Interior-point methods (90C51) Optimality conditions for minimax problems (49K35)

Related Items (9)

Mean and variance optimization of non-linear systems and worst-case analysis ⋮ Risk minimization and optimal derivative design in a principal agent game ⋮ Multiobjective problems with fuzzy parameters and games against nature ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ A computational algorithm for selecting robust designs in safety and quality critical processes ⋮ \(E\)-differentiable minimax programming under \(E\)-convexity ⋮ An algorithm for the global optimization of a class of continuous minimax problems ⋮ Biobjective robust simulation-based optimization for unconstrained problems ⋮ Globally convergent interior-point algorithm for nonlinear programming

This page was built for publication: An interior point algorithm for computing saddle points of constrained continuous minimax