A Second-order method for the discrete min-max problem
From MaRDI portal
Publication:3887253
DOI10.1016/0041-5553(79)90069-7zbMath0443.90091MaRDI QIDQ3887253
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
rate of convergence; second-order method; discrete min-max problem; quadratic approximation of the constraints
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
49J35: Existence of solutions for minimax problems
41A25: Rate of convergence, degree of approximation
Related Items
Second-order minimization method for nonsmooth functions allowing convex quadratic approximations of the augment, 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, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, Quadratically constraint quadratical algorithm model for nonlinear minimax problems, 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
