On smooth relaxations of obstacle sets

DOI10.1007/s11081-013-9224-8zbMath1310.65068OpenAlexW1978455524MaRDI QIDQ2254177

Paul Steuermann, Oliver Stein

Publication date: 4 February 2015

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-013-9224-8

zbMATH Keywords

numerical examplerelaxationerror boundLipschitz continuityobstacle problemhyperbolic smoothingconvex inequality constraintsentropic smoothingobstacle sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
• A smoothing trust-region Newton-CG method for minimax problem
• On NCP-functions
• On the entropic regularization method for solving min-max problems with applications
• A note of Lipschitz constants for solutions of linear inequalities and equations
• An Application of Error Bounds for Convex Programming in a Linear Space
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• Convex Analysis
• On logarithmic smoothing of the maximum function

This page was built for publication: On smooth relaxations of obstacle sets