A subgradient algorithm for certain minimax and minisum problems

DOI10.1007/BF01609012MaRDI QIDQ4174536zbMATH OpenOpenAlexFDO

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

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)

Cites work

• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3554030 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• An Algorithm for Constrained Optimization with Semismooth Functions
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• Convex Analysis
• Finding the nearest point in A polytope
• Generalized Gradients and Applications
• Optimization of lipschitz continuous functions
• Variations on Variable-Metric Methods

Cited in

(16)

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

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

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