Optimal covering of plane domains by circles via hyperbolic smoothing

DOI10.1007/s10898-004-0737-8zbMath1093.90023OpenAlexW2054895580MaRDI QIDQ813342

Antonio Alberto Fernandes de Oliveira, Adilson Elias Xavier

Publication date: 8 February 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-0737-8

zbMATH Keywords

SmoothingMin-max-min problemsLocation problemsNon-differentiable programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Continuous location (90B85) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (17)

Optimal covering points and curves ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ A new smoothing approach to exact penalty functions for inequality constrained optimization problems ⋮ A Shape-Newton Approach to the Problem of Covering with Identical Balls ⋮ The hyperbolic smoothing clustering method ⋮ Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ A new global optimization technique by auxiliary function method in a directional search ⋮ Hyperbolic smoothing and penalty techniques applied to molecular structure determination ⋮ Hyperbolic regression: a new regression model with applications to the binary classification problem ⋮ An incremental nonsmooth optimization algorithm for clustering using \(L_1\) and \(L_\infty\) norms ⋮ An algorithm for clusterwise linear regression based on smoothing techniques ⋮ A hyperbolic smoothing approach to the multisource Weber problem ⋮ An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem ⋮ On a new smoothing technique for non-smooth, non-convex optimization ⋮ Hyperbolic smoothing function method for minimax problems ⋮ A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls ⋮ An incremental clustering algorithm based on hyperbolic smoothing

Cites Work

• A smooth method for the finite minimax problem
• New results in the packing of equal circles in a square
• Minimax and applications
• On the maximization of a certain nondifferentiable function
• Smooth Optimization Methods for Minimax Problems
• On Smoothing Exact Penalty Functions for Convex Constrained Optimization
• The sphere packing problem

This page was built for publication: Optimal covering of plane domains by circles via hyperbolic smoothing