A Regularization Method for Solving the Finite Convex Min-Max Problem
From MaRDI portal
Publication:5748481
DOI10.1137/0727095zbMath0717.49009MaRDI QIDQ5748481
Publication date: 1990
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0727095
49J35: Existence of solutions for minimax problems
Related Items
A relaxed cutting plane algorithm for solving fuzzy inequality systems, A minimax method with application to the initial vector coding problem*, Solving fuzzy variational inequalities over a compact set, A generalized neural network for solving a class of minimax optimization problems with linear constraints, Algorithms with adaptive smoothing for finite minimax problems, A smooth method for the finite minimax problem, Convergence of the approximate auxiliary problem method for solving generalized variational inequalities, New exact penalty function for solving constrained finite min-max problems, A truncated aggregate smoothing Newton method for minimax problems, Solving mathematical programs with fuzzy equilibrium constraints, Error bounds of two smoothing approximations for semi-infinite minimax problems, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, On the entropic regularization method for solving min-max problems with applications, Solving variational inequalities in a fuzzy environment, Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions, Solving min-max problems and linear semi-infinite programs, A hybrid algorithm for nonlinear minimax problems, Variable programming: a generalized minimax problem. II: Algorithms, The optimization technique for solving a class of non-differentiable programming based on neural network method
