MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  A globally convergent BFGS method for nonsmooth convex optimization (1996) [2 citations — 1 self]

Download:
pdf | ps
by A. I. Rauf, M. Fukushima
Journal of Optimization Theory and Applications
http://halo.kuamp.kyoto-u.ac.jp/zagato/member/staff/fuku/./papers/MY-BFGS-rev.ps.Z
Add To MetaCart

Abstract:

Abstract. We propose an implementable BFGS method for solving a nonsmooth convex optimization problem by converting the original objective function to a once continuously differentiable function by way of Moreau-Yosida regularization. The proposed method makes use of approximate function and gradient values of the Moreau-Yosida regularization instead of the corresponding exact values. We prove global convergence of the proposed method under the assumption of strong convexity of the objective function. Key Words. Nonsmooth convex optimization, Moreau-Yosida regularization, strong convexity, inexact function and gradient evaluation, BFGS method.

Citations

352 Rheinboldt, Iterative Solution of Nonlinear Equations – Ortega, W - 2000
232 Numerical methods for unconstrained optimization and nonlinear equations – Schnabel - 1983
195 Convex Analysis and Minimization Algorithms I – Hiriart-Urruty, Lemarecal - 1993
126 Functional Analysis – Yosida - 1965
80 Practical Methods of Optimization, 2nd ed – Fletcher - 1987
38 Atool for the analysis of quasi-Newton methods with application to unconstrained minimization – BYRD, NOCEDAL - 1989
36 Proximité et dualité dans un espace Hilbertien – Moreau - 1965
30 Convergence of Some Algorithms for Convex Minimization – Correa, Lemaréchal - 1993
29 Practical aspects of the Moreau-Yosida regularization: theoretical preliminaries – Lemaréchal, Sagastizábal - 1997
28 Some global convergence properties of a variable metric algorithm for minimization without exact line searches – Powell - 1976
24 Global convergence of a class of quasi-Newton methods on convex problems – Byrd, Nocedal, et al. - 1987
23 Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity – Robinson - 1987
20 A variable metric proximal point algorithm for monotone operators – Burke, Qian - 1998
20 Numerical methods for nondifferentiable convex optimization – Auslender - 1987
18 A Quasi-second-order Proximal Bundle Algorithm – Mifflin - 1996
18 Variable metric bundle methods: From conceptual to implementable forms – Lemaréchal, Sagastizàbal - 1997
14 An approach to variable metric bundle methods – Lemar'echal, Sagastiz'abal - 1994
14 Local Convergence of Quasi-Newton Methods for B-differentiable Equations – IP, KYPARISIS - 1992
13 A preconditioning proximal Newton method for nondifferentiable convex optimization – Qi, Chen - 1995
11 Quasi-Newton bundle-type methods for nondifferentiable convex optimization – Mifflin, Sun, et al. - 1998
10 A family of variable metric proximal methods – Bonnans, Gilbert, et al. - 1995
10 Proximal quasi-Newton methods for nondifferentiable convex optimization – Chen, Fukushima - 1995
10 A descent algorithm for nonsmooth convex optimization – Fukushima - 1984
9 A globally and superlinearly convergent algorithm for nonsmooth convex minimization – Fukushima, Qi - 1996
7 Second-order analysis of the Moreau-Yosida regularization of a convex function, Preprint, Revised version – Qi - 1995
7 Convergence of the BFGS method for LC convex constrained optimization – Chen - 1996
2 Super-linear convergence of the Chen-Fukushima variable metric proximal point algorithm with BFGS updating – Burke, Qian - 1996