A subgradient algorithm for certain minimax and minisum problems

DOI10.1007/BF01609012zbMath0392.90065OpenAlexW1966369193MaRDI QIDQ4174536

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

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01609012

zbMATH Keywords

ConvergenceApproximation and Location TheoryMinimax and Minisum ProblemsSubgradient Algorithm

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (16)

Minimax linear programming problem ⋮ The optimal solution set of the multi-source Weber problem ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Duality for constrained multifacility location problems with mixed norms and applications ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ Uniform approximation of min/max functions by smooth splines ⋮ An algorithm for solving linearly constrained minimax problems ⋮ Locational analysis ⋮ A quadratically convergent method for minimizing a sum of euclidean norms ⋮ When facilities coincide: Exact optimality conditions in multifacility location ⋮ Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l₁- and l_∞-norms ⋮ The balanced linear programming problem ⋮ Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem ⋮ An active set smoothing method for solving unconstrained minimax problems ⋮ Descent algorithm for a class of convex nondifferentiable functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Gradients and Applications
• Finding the nearest point in A polytope
• Optimization of lipschitz continuous functions
• An Algorithm for Constrained Optimization with Semismooth Functions
• Convex Analysis
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• Variations on Variable-Metric Methods

This page was built for publication: A subgradient algorithm for certain minimax and minisum problems