Solving a Generalized Heron Problem by Means of Convex Analysis
From MaRDI portal
Publication:2904856
DOI10.4169/amer.math.monthly.119.02.087zbMath1245.90086arXiv1011.3242OpenAlexW1639967547WikidataQ58298313 ScholiaQ58298313MaRDI QIDQ2904856
Juan Jun. Salinas, Nguyen Mau Nam, Boris S. Mordukhovich
Publication date: 24 August 2012
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.3242
Convex programming (90C25) Nonsmooth analysis (49J52) Mathematical programming (educational aspects) (97N60)
Related Items (17)
Inertial Douglas-Rachford splitting for monotone inclusion problems ⋮ Convergence analysis of two-step inertial Douglas-Rachford algorithm and application ⋮ The plasticity of non-overlapping convex sets in R^{2} ⋮ A product space reformulation with reduced dimension for splitting algorithms ⋮ Two proximal splitting methods in Hadamard spaces ⋮ A parameterized Douglas-Rachford algorithm ⋮ Distance majorization and its applications ⋮ The generalized Fermat-Torricelli problem in Hilbert spaces ⋮ On some novel methods for solving the generalized Fermat-Torricelli problem in Hilbert spaces ⋮ Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery ⋮ Optimality conditions for 2-regular problems with nonsmooth objective functions ⋮ Minsum location extended to gauges and to convex sets ⋮ \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm ⋮ Solving composite fixed point problems with block updates ⋮ An MM Algorithm for Split Feasibility Problems ⋮ Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems ⋮ Applications of variational analysis to a generalized Heron problem
This page was built for publication: Solving a Generalized Heron Problem by Means of Convex Analysis
