Pages that link to "Item:Q4174536"
From MaRDI portal
The following pages link to A subgradient algorithm for certain minimax and minisum problems (Q4174536):
Displaying 15 items.
- A projected Weiszfeld algorithm for the box-constrained Weber location problem (Q425491) (← links)
- Uniform approximation of min/max functions by smooth splines (Q651900) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- Duality for constrained multifacility location problems with mixed norms and applications (Q920027) (← links)
- Minimax linear programming problem (Q1075944) (← links)
- An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
- Locational analysis (Q1173002) (← links)
- When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory (Q1717808) (← links)
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem (Q1825115) (← links)
- The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
- A quadratically convergent method for minimizing a sum of euclidean norms (Q3321365) (← links)
- Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l<sub>1</sub>- and l<sub>∞</sub>-norms (Q5455173) (← links)
