On the entropic regularization method for solving min-max problems with applications

DOI10.1007/BF01199466zbMath0886.90133OpenAlexW2069770680MaRDI QIDQ1366322

Publication date: 10 May 1998

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01199466

zbMATH Keywords

entropy optimization non-differentiability min-max problem smooth approximation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

An entropic regularization approach for mathematical programs with equilibrium constraints ⋮ A relaxed cutting plane algorithm for solving fuzzy inequality systems ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ The optimization technique for solving a class of non-differentiable programming based on neural network method ⋮ Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Approaches to four types of bilevel programming problems with nonconvex nonsmooth lower level programs and their applications to newsvendor problems ⋮ An aggregate deformation homotopy method for min-max-min problems with max-min constraints ⋮ An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems ⋮ A generalized neural network for solving a class of minimax optimization problems with linear constraints ⋮ A smoothing method for zero--one constrained extremum problems ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A nonmonotone line search based algorithm for distribution center location selected ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ Unnamed Item ⋮ On smooth relaxations of obstacle sets ⋮ Design of computer experiments: space filling and beyond ⋮ Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ An entropy regularization technique for minimizing a sum of Tchebycheff norms ⋮ Solving fuzzy variational inequalities over a compact set ⋮ Variable programming: a generalized minimax problem. II: Algorithms ⋮ A dual algorithm for minimax problems ⋮ Truncated aggregate homotopy method for nonconvex nonlinear programming ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Solving mathematical programs with fuzzy equilibrium constraints ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Smoothing method for minimizing the sum of therlargest functions ⋮ A regularized approach for frictional impact dynamics of flexible multi-link manipulator arms considering the dynamic stiffening effect ⋮ A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints ⋮ An Equivalent Identification Method for Dynamic Loads Acting on Nonlinear Structures ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ An efficient algorithm for the Euclidean \(r\)-centrum location problem ⋮ Solving variational inequalities in a fuzzy environment ⋮ An aggregate homotopy method for solving unconstrained minimax problems ⋮ Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems

Cites Work