Minimization of a class of non-differentiable functionals by a relaxation method

DOI10.1016/0041-5553(87)90002-4zbMATH Open0696.90057OpenAlexW2371534430MaRDI QIDQ3474485FDOQ3474485

Authors: Sergey Repin 

Publication date: 1987

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(87)90002-4

Recommendations

• A method for minimizing convex functions based on continuous approximations to the subdifferential
• scientific article; zbMATH DE number 67982
• A minimizing algorithm for complex nonconvex nondifferentiable functions
• A method for minimizing the sum of a convex function and a continuously differentiable function
• Two methods for minimizing convex functions in a class of nonconvex sets

zbMATH Keywords

nondifferentiable programmingsum-type objective functionsum of convex functionals

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited In (5)

• On the relaxation of some classes of dirichlet minimum problems
• On the relaxation of Dirichlet minimum problems for some classes of unbounded integral functionals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimization of non-smooth, non-convex functionals by iterative thresholding

This page was built for publication: Minimization of a class of non-differentiable functionals by a relaxation method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3474485)