A subgradient algorithm for certain minimax and minisum problems
From MaRDI portal
Publication:4174536
DOI10.1007/BF01609012zbMATH Open0392.90065OpenAlexW1966369193MaRDI QIDQ4174536FDOQ4174536
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
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Optimization of lipschitz continuous functions
- Generalized Gradients and Applications
- Finding the nearest point in A polytope
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 l1- 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)
