Optimization Online


Epi-convergent Smoothing with Applications to Convex Composite Functions

James V. Burke(burke***at***math.washington.edu)
Tim Hoheisel(hoheisel***at***mathematik.uni-wuerzburg.de)

Abstract: Smoothing methods have become part of the standard tool set for the study and solution of nondifferentiable and constrained optimization problems as well as a range of other variational and equilibrium problems. In this note we synthesize and extend recent results due to Beck and Teboulle on infimal convolution smoothing for convex functions with those of X. Chen on gradient consistency for nonconvex functions. We use epi-convergence techniques to define a notion of epi-smoothing that allows us to tap into the rich variational structure of the subdifferential calculus for nonsmooth, nonconvex, and nonfinite-valued functions. As an illustration of the versatility and range of epi-smoothing techniques, the results are applied to the general constrained optimization for which nonlinear programming is a special case.

Keywords: smoothing method, subdifferential calculus, epi-convergence, infimal convolution, Moreau envelope, convex composite function, Karush-Kuhn-Tucker conditions

Category 1: Convex and Nonsmooth Optimization

Category 2: Nonlinear Optimization

Citation: Mathematics Department, University of Washington

Download: [PDF]

Entry Submitted: 08/31/2012
Entry Accepted: 08/31/2012
Entry Last Modified: 08/31/2012

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society