A Second-order method for the discrete min-max problem
DOI10.1016/0041-5553(79)90069-7zbMATH Open0443.90091OpenAlexW2077947091MaRDI QIDQ3887253FDOQ3887253
Authors: 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
rate of convergencesecond-order methoddiscrete min-max problemquadratic approximation of the constraints
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25) Existence of solutions for minimax problems (49J35)
Cited In (8)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A sequential quadratically constrained quadratic programming method of feasible directions
- 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
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results
This page was built for publication: A Second-order method for the discrete min-max problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887253)
