New algorithms for constrained minimax optimization
From MaRDI portal
Publication:4145173
DOI10.1007/BF01584333zbMath0368.90122OpenAlexW1989589595MaRDI QIDQ4145173
S. R. K. Dutta, Mathukumalli Vidyasagar
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584333
Related Items (18)
Minimax linear programming problem ⋮ Relaxation-based algorithms for minimax optimization problems with resource allocation applications ⋮ An algorithm for separable nonlinear minimax problems ⋮ A superlinearly convergent constrained min-max algorithm for rival models of the same system ⋮ Nondifferentiable design optimization problems with application to control engineering ⋮ Minimization of convex functionals involving nested maxima: Nonconcave duality and algorithms ⋮ An algorithm for convex constrained minimax optimization based on duality ⋮ An algorithm for solving linearly constrained minimax problems ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ A constrained min-max algorithm for rival models of the same economic system ⋮ A lexicographic minimax algorithm for multiperiod resource allocation ⋮ Optimization of electrical circuits ⋮ A note on ‘new algorithms for constrained minimax optimization’ ⋮ System order reduction using the induced operator norm and its applications to linear regulators ⋮ Min-max optimization of several classical discrete optimization problems ⋮ Multi-period minimax hedging strategies ⋮ The balanced linear programming problem ⋮ Robust min-max portfolio strategies for rival forecast and risk scenarios
Cites Work
This page was built for publication: New algorithms for constrained minimax optimization
