A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity

DOI10.1007/BF01447746zbMath0734.73097OpenAlexW2162256165MaRDI QIDQ811227

N. E. Zubov

Publication date: 1991

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01447746

zbMATH Keywords

smoothinglocation problemsnonsmooth functionalssuccessive approximationFermat-Weber problemestimation of the solution errorlarge-scale simply supported square platelinear weighted least-squares problemsmall-scale three bar trussstopping criterion for the algorithm

Mathematics Subject Classification ID

Related Items (4)

Successive smoothing algorithm for solving large-scale optimization models with fixed cost ⋮ Weiszfeld's method: old and new results ⋮ Huber approximation for the non-linear \(l_{1}\) problem ⋮ Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• A geometric property of the least squares solution of linear equations
• A primal-dual algorithm for the fermat-weber problem involving mixed gauges
• A projected newton method forl p norm location problems
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• A Generalized von Mises Criterion for Yield and Fracture
• An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-Approximation
• Numerical Solution of the Minimal Surface Equation
• Convex Analysis
• A note on Fermat's problem

This page was built for publication: A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity