On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
From MaRDI portal
Publication:3988950
DOI10.1137/0330023zbMath0756.90088OpenAlexW2064380469MaRDI 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
Newton-type methods (49M15) Semi-infinite programming (90C34) Optimality conditions for minimax problems (49K35)
Related Items
An efficient algorithm for solving semi-infinite inequality problems with box constraints, Quadratically constraint quadratical algorithm model for nonlinear minimax problems, Algorithms with adaptive smoothing for finite minimax problems, Substitution secant/finite difference method to large sparse minimax problems, Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems, Inexact smoothing method for large scale minimax optimization, Asymptotic surrogate constraint method and its convergence for a class of semi-infinite programming, Group update method for sparse minimax problems, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming, A spline smoothing Newton method for semi-infinite minimax problems, On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
