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

DOI10.1137/0320034MaRDI QIDQ3963619zbMATH OpenOpenAlexFDO

Authors Jacques Chatelon, Donald W. Hearn, 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) Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Existence of solutions for minimax problems (49J35)

Cited in

(8)

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

This page was built for publication: A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3963619)