A Regularization Method for Solving the Finite Convex Min-Max Problem

DOI10.1137/0727095zbMATH Open0717.49009OpenAlexW2073511903MaRDI QIDQ5748481FDOQ5748481

Authors: Cristina Gígola, Susana Gómez 

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

Recommendations

• A global regularization method for solving the finite min-max problem
• scientific article; zbMATH DE number 17725
• Solution of minimax problems using equivalent differentiable functions
• scientific article; zbMATH DE number 653049
• Finding a minimax with specified accuracy

zbMATH Keywords

regularizationnondifferentiable optimization

Mathematics Subject Classification ID

Existence of solutions for minimax problems (49J35)

Cited In (35)

• Title not available (Why is that?)
• Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variable programming: a generalized minimax problem. II: Algorithms
• The optimization technique for solving a class of non-differentiable programming based on neural network method
• Flattened aggregate function method for nonlinear programming with many complicated constraints
• A hybrid algorithm for nonlinear minimax problems
• A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
• A dual regularized method in convex finite-dimensional optimization problems
• Convergence of the approximate auxiliary problem method for solving generalized variational inequalities
• A choice of the regularization parameter in solving convex extremal problems
• Algorithms with adaptive smoothing for finite minimax problems
• An Incremental Method for Solving Convex Finite Min-Max Problems
• A generalized neural network for solving a class of minimax optimization problems with linear constraints
• Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
• New exact penalty function for solving constrained finite min-max problems
• Solving fuzzy variational inequalities over a compact set
• Solving min-max problems and linear semi-infinite programs
• On the entropic regularization method for solving min-max problems with applications
• Title not available (Why is that?)
• A dual regularized method for solving a class of convex minimization problems
• A relaxed cutting plane algorithm for solving fuzzy inequality systems
• Solving mathematical programs with fuzzy equilibrium constraints
• Title not available (Why is that?)
• An adaptive smoothing method for continuous minimax problems
• Title not available (Why is that?)
• Solving variational inequalities in a fuzzy environment
• A minimax method with application to the initial vector coding problem^*
• A smooth method for the finite minimax problem
• Error bounds of two smoothing approximations for semi-infinite minimax problems
• A truncated aggregate smoothing Newton method for minimax problems
• On the regularization method for conflicting problems of convex programming
• Title not available (Why is that?)
• A spline smoothing Newton method for finite minimax problems

This page was built for publication: A Regularization Method for Solving the Finite Convex Min-Max Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5748481)