On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
From MaRDI portal
Publication:3988950
DOI10.1137/0330023zbMath0756.90088MaRDI QIDQ3988950
Elijah Polak, J. E. Higgins, David Q. Mayne
Publication date: 28 June 1992
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0330023
49M15: Newton-type methods
90C34: Semi-infinite programming
49K35: Optimality conditions for minimax problems
Related Items
Substitution secant/finite difference method to large sparse minimax problems, Inexact smoothing method for large scale minimax optimization, Group update method for sparse minimax problems, Algorithms with adaptive smoothing for finite minimax problems, A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems, An efficient algorithm for solving semi-infinite inequality problems with box constraints, Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems, Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming, A spline smoothing Newton method for semi-infinite minimax problems, Quadratically constraint quadratical algorithm model for nonlinear minimax problems
