A smooth method for the finite minimax problem

DOI10.1007/BF01580609zbMath0799.90106MaRDI QIDQ689121

Luigi Grippo, Gianni Di Pillo, Stefano Lucidi

Publication date: 6 December 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

continuously differentiable exact penalty functionfinite minimax problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Existence of solutions for minimax problems (49J35)

Related Items (47)

A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities ⋮ A relaxed cutting plane algorithm for solving fuzzy inequality systems ⋮ Exact barrier function methods for Lipschitz programs ⋮ A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints ⋮ A minimax model and arithmetic for initial emission permits ⋮ On the entropic regularization method for solving min-max problems with applications ⋮ Smooth transformation of the generalized minimax problem ⋮ A derivative-free approximate gradient sampling algorithm for finite minimax problems ⋮ A hybrid algorithm for linearly constrained minimax problems ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ A nonlinear augmented Lagrangian for constrained minimax problems ⋮ An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems ⋮ Unnamed Item ⋮ Uniform approximation of min/max functions by smooth splines ⋮ An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems ⋮ A nonmonotone line search based algorithm for distribution center location selected ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem ⋮ Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch ⋮ A fast gradient and function sampling method for finite-max functions ⋮ Further study on a dual algorithm ⋮ Solving fuzzy variational inequalities over a compact set ⋮ Variable programming: a generalized minimax problem. II: Algorithms ⋮ A dual algorithm for minimax problems ⋮ A derivative-free trust-region algorithm for composite nonsmooth optimization ⋮ Solving mathematical programs with fuzzy equilibrium constraints ⋮ A hybrid algorithm for nonlinear minimax problems ⋮ Constraint incorporation in optimization ⋮ Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ Essentials of numerical nonsmooth optimization ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ Solving min-max problems and linear semi-infinite programs ⋮ A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ New exact penalty function for solving constrained finite min-max problems ⋮ An active set smoothing method for solving unconstrained minimax problems ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ 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 ⋮ Essentials of numerical nonsmooth optimization ⋮ A projected conjugate gradient method for sparse minimax problems ⋮ Optimal covering of plane domains by circles via hyperbolic smoothing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods of descent for nondifferentiable optimization
• Superlinearly convergent algorithm for min-max problems
• A multiplier method with automatic limitation of penalty growth
• On the superlinear convergence of a trust region algorithm for nonsmooth optimization
• An exact penalty function method with global convergence properties for nonlinear programming problems
• Smooth Optimization Methods for Minimax Problems
• Acceleration of the leastpth algorithm for minimax optimization with engineering applications
• Variable metric methods for minimizing a class of nondifferentiable functions
• Combined lp and quasi-Newton methods for minimax optimization
• A smoothing-out technique for min—max optimization
• A model algorithm for composite nondifferentiable optimization problems
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• New Results on a Continuously Differentiable Exact Penalty Function
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• An Efficient Method to Solve the Minimax Problem Directly
• An Algorithm for Constrained Optimization with Semismooth Functions
• An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
• A Regularization Method for Solving the Finite Convex Min-Max Problem

This page was built for publication: A smooth method for the finite minimax problem