Quadratic rate of convergence of a linearization method for solving discrete minimax problems

DOI10.1016/0041-5553(81)90031-8zbMATH Open0509.90059OpenAlexW2072944004MaRDI QIDQ4749599FDOQ4749599

Authors: V. A. Daugavet, V. 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

zbMATH Keywords

quadratic convergence ratequadratic subproblemdiscrete minimax problemPshenichnyj's linearization method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Existence of solutions for minimax problems (49J35)

Cited In (7)

• Superlinearly convergent algorithm for min-max problems
• On the rate of convergence of two minimax algorithms
• Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
• A convergence analysis of the method of codifferential descent
• Minmaxmin problems revisited
• A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
• Asymptotic equivalence of two finite penalty methods of first order

This page was built for publication: Quadratic rate of convergence of a linearization method for solving discrete minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4749599)