An algorithm for convex constrained minimax optimization based on duality
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3704323 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3511879 (Why is no real title available?)
- scientific article; zbMATH DE number 3247810 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 3334605 (Why is no real title available?)
- A differential game with two pursuers and one evader
- An Efficient Method to Solve the Minimax Problem Directly
- Approximation procedures based on the method of multipliers
- Auxiliary problem principle and decomposition of optimization problems
- Linearly constrained minimax optimization
- Minimax solution of the multiple-target problem
- New algorithms for constrained minimax optimization
- Optimization by Least Squares
- Optimization by decomposition and coordination: A unified approach
Cited in
(6)- Robust min-max portfolio strategies for rival forecast and risk scenarios
- A superlinearly convergent constrained min-max algorithm for rival models of the same system
- Minimization of convex functionals involving nested maxima: Nonconcave duality and algorithms
- Point-to-point trajectory planning of wheeled mobile manipulators with stability constraint. Extension of the random-profile approach
- Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations
- A constrained min-max algorithm for rival models of the same economic system
This page was built for publication: An algorithm for convex constrained minimax optimization based on duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160889)