A Second-order method for the discrete min-max problem

DOI10.1016/0041-5553(79)90069-7zbMath0443.90091OpenAlexW2077947091MaRDI QIDQ3887253

V. M. Panin

Publication date: 1979

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(79)90069-7

zbMATH Keywords

rate of convergencesecond-order methoddiscrete min-max problemquadratic approximation of the constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35) Rate of convergence, degree of approximation (41A25)

Related Items (8)

Quadratically constraint quadratical algorithm model for nonlinear minimax problems ⋮ Second-order minimization method for nonsmooth functions allowing convex quadratic approximations of the augment ⋮ A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results ⋮ On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions

This page was built for publication: A Second-order method for the discrete min-max problem