On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems

DOI10.1016/0022-247X(91)90359-8zbMath0755.49013MaRDI QIDQ1190317

Helmut Dietrich

Publication date: 27 September 1992

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

convexificationdescent methodinfinite dimensional, nonsmooth and nonconvex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods based on necessary conditions (49M05) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Related Items (3)

New optimality conditions for a nondifferentiable fractional semipreinvex programming problem ⋮ A new approach to the investigation of evolution differential equations in Banach spaces ⋮ A Generalization of the lasry-lions method for functions in reflexive banach spaces

Cites Work

• Globally convergent decomposition methods for nonconvex optimization problems
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Duality in nonconvex optimization
• Submonotone mappings and the proximal point algorithm
• On uniformly convex functions

This page was built for publication: On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems