Quadratic rate of convergence of a linearization method for solving discrete minimax problems
From MaRDI portal
Publication:4749599
DOI10.1016/0041-5553(81)90031-8zbMath0509.90059OpenAlexW2072944004MaRDI QIDQ4749599
V. A. Daugavet, Vasily N. Malozemov
Publication date: 1981
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(81)90031-8
quadratic convergence ratequadratic subproblemdiscrete minimax problemPshenichnyj's linearization method
Numerical mathematical programming methods (65K05) Integer programming (90C10) Existence of solutions for minimax problems (49J35)
Related Items (7)
A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints ⋮ A convergence analysis of the method of codifferential descent ⋮ Asymptotic equivalence of two finite penalty methods of first order ⋮ Minmaxmin problems revisited ⋮ Superlinearly convergent algorithm for min-max problems ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ On the rate of convergence of two minimax algorithms
This page was built for publication: Quadratic rate of convergence of a linearization method for solving discrete minimax problems
