The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems

DOI10.1007/s10957-015-0811-zzbMath1342.49050arXiv1303.7247OpenAlexW1783616983MaRDI QIDQ274096

Daniel Giles, Nguyen Thai An, R. Blake Rector, Nguyen Mau Nam

Publication date: 22 April 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.7247

zbMATH Keywords

generalized Sylvester problemlog-exponential smoothing techniquemajorization-minimization algorithmNesterov's accelerated gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality ⋮ Solving \(k\)-center problems involving sets based on optimization techniques

Uses Software

• Miniball

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Distance majorization and its applications
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
• Minsum location extended to gauges and to convex sets
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• On the smallest enclosing balls
• Efficient algorithms for the smallest enclosing ball problem
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• Subdifferentials of a minimum time function in Banach spaces
• Applications of Convex Analysis to the Smallest Intersecting Ball Problem
• Two Algorithms for the Minimum Enclosing Ball Problem
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems
• Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
• On the Minimum Volume Covering Ellipsoid of Ellipsoids

This page was built for publication: The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems