A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case

DOI10.1137/0320034zbMath0498.49020OpenAlexW2073619433MaRDI QIDQ3963619

Donald W. Hearn, Jacques Chatelon, Timothy J. Lowe

Publication date: 1982

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0320034

zbMATH Keywords

feasible direction algorithmnondifferentiable nonlinear programmingconvergence to an optimal solution

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence of solutions for minimax problems (49J35) Methods of successive quadratic programming type (90C55)

Related Items

A heuristic algorithm for minimax sensor location in the plane, A constraint linearization method for nondifferentiable convex minimization, Geometric interpretation of the optimality conditions in multifacility location and applications, Proximity control in bundle methods for convex nondifferentiable minimization, Duality for constrained multifacility location problems with mixed norms and applications, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, Some personal views on the current state and the future of locational analysis, Solution of minimax problems using equivalent differentiable functions