A smooth method for the finite minimax problem

DOI10.1007/BF01580609zbMath0799.90106MaRDI QIDQ689121

Stefano Lucidi, Gianni Di Pillo, Luigi Grippo

Publication date: 6 December 1993

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

zbMATH Keywords

continuously differentiable exact penalty function; finite minimax problems

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

49J35: Existence of solutions for minimax problems

Related Items

A relaxed cutting plane algorithm for solving fuzzy inequality systems, A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem, Solving fuzzy variational inequalities over a compact set, A derivative-free approximate gradient sampling algorithm for finite minimax problems, A hybrid algorithm for linearly constrained minimax problems, A nonlinear augmented Lagrangian for constrained minimax problems, Algorithms with adaptive smoothing for finite minimax problems, Uniform approximation of min/max functions by smooth splines, New exact penalty function for solving constrained finite min-max problems, Optimal covering of plane domains by circles via hyperbolic smoothing, A minimax model and arithmetic for initial emission permits, Solving mathematical programs with fuzzy equilibrium constraints, Constraint incorporation in optimization, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, A projected conjugate gradient method for sparse minimax problems, On the entropic regularization method for solving min-max problems with applications, Smooth transformation of the generalized minimax problem, Solving variational inequalities in a fuzzy environment, Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions, A dual algorithm for minimax problems, Solving min-max problems and linear semi-infinite programs, Exact barrier function methods for Lipschitz programs, A hybrid algorithm for nonlinear minimax problems, An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems, Further study on a dual algorithm, Variable programming: a generalized minimax problem. II: Algorithms

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item