Smooth transformation of the generalized minimax problem

DOI10.1023/A:1022627226891zbMath0890.90165MaRDI QIDQ1372537

Luigi Grippo, Stefano Lucidi, Gianni Di Pillo

Publication date: 22 June 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationnonlinear programmingnondifferentiable optimizationminimax problemsgeneralized minimax problems

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Existence of solutions for minimax problems (49J35)

Related Items

The optimization technique for solving a class of non-differentiable programming based on neural network method, Neural network for constrained nonsmooth optimization using Tikhonov regularization, Unnamed Item, Further study on a dual algorithm, Constraint incorporation in optimization, Essentials of numerical nonsmooth optimization, Essentials of numerical nonsmooth optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A smooth method for the finite minimax problem
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• Algorithms for a class of nondifferentiable problems
• On the global stabilization of locally convergent algorithms
• Methods of descent for nondifferentiable optimization
• Superlinearly convergent algorithm for min-max problems
• A multiplier method with automatic limitation of penalty growth
• A bundle type approach to the unconstrained minimization of convex nonsmooth functions
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• 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 Algorithm for Constrained Optimization with Semismooth Functions