Smoothing method for minimizing the sum of therlargest functions

DOI10.1080/03043790500478424zbMath1129.90042OpenAlexW1996802316MaRDI QIDQ5758222

Suyan He, Shaohua Pan, Xing-Si Li

Publication date: 3 September 2007

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03043790500478424

zbMATH Keywords

facility locationsmoothing methodsum of the \(r\) largest functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Continuous location (90B85)

Cites Work

• Unnamed Item
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• On the limited memory BFGS method for large scale optimization
• Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
• On the entropic regularization method for solving min-max problems with applications
• Efficient algorithms for the smallest enclosing ball problem
• Minimizing the sum of the \(k\) largest functions in linear time.
• Smoothing methods for convex inequalities and linear complementarity problems
• Properties of thek-centra in a tree network
• Linear Programming in Linear Time When the Dimension Is Fixed
• Centers to centroids in graphs
• Determinant Maximization with Linear Matrix Inequality Constraints
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Minimax parametric optimization problems and multi-dimensional parametric searching
• The \(k\)-centrum multi-facility location problem