On the rate of convergence of two minimax algorithms

DOI10.1007/BF00940037zbMath0793.90079MaRDI QIDQ1321092

Elijah Polak, E. J. Wiest

Publication date: 27 April 1994

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

zbMATH Keywords

nonsmooth optimizationminimax problemlinear convergencecomposite nondifferentiable optimizationsecond-order sufficiency condition

Mathematics Subject Classification ID

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

Related Items

A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, On solving large-scale finite minimax problems using exponential smoothing

Uses Software

• LSSOL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Pironneau-Polak method of centers
• Algorithms for some minimax problems
• Minimization of functions having Lipschitz continuous first partial derivatives
• A regularized decomposition method for minimizing a sum of polyhedral functions
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• Optimality conditions for piecewise smooth functions
• Simplicial decomposition in nonlinear programming algorithms
• Linearly constrained minimax optimization
• Quadratic rate of convergence of a linearization method for solving discrete minimax problems
• On the rate of convergence of certain methods of centers