A quasi-second-order proximal bundle algorithm
暂无分享,去创建一个
[1] Masao Fukushima,et al. A descent algorithm for nonsmooth convex optimization , 1984, Math. Program..
[2] Claude Lemaréchal,et al. Convergence of some algorithms for convex minimization , 1993, Math. Program..
[3] Claude Lemaréchal,et al. An approach to variable metric bundle methods , 1993, System Modelling and Optimization.
[4] C. Lemaréchal. An extension of davidon methods to non differentiable problems , 1975 .
[5] B. Martinet. Brève communication. Régularisation d'inéquations variationnelles par approximations successives , 1970 .
[6] J. Moreau. Proximité et dualité dans un espace hilbertien , 1965 .
[7] Robert Mifflin,et al. Better than linear convergence and safeguarding in nonsmooth minimization , 1984 .
[8] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[9] Jonathan E. Spingarn,et al. Applications of the method of partial inverses to convex programming: Decomposition , 1985, Math. Program..
[10] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .
[11] Robert Mifflin,et al. The least prior deviation quasi-Newton update , 1994, Math. Program..
[12] M. Al-Baali. Variational quasi-Newton methods for unconstrained optimization , 1993 .
[13] J. Frédéric Bonnans,et al. A family of variable metric proximal methods , 1995, Math. Program..
[14] A. A. Goldstein,et al. Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.
[15] C. Lemaréchal. Chapter VII Nondifferentiable optimization , 1989 .
[16] A. Auslender. Numerical methods for nondifferentiable convex optimization , 1987 .
[17] Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..
[18] Liqun Qi,et al. A nonsmooth version of Newton's method , 1993, Math. Program..
[19] Krzysztof C. Kiwiel,et al. Proximity control in bundle methods for convex nondifferentiable minimization , 1990, Math. Program..
[20] J. J. Moré,et al. Quasi-Newton Methods, Motivation and Theory , 1974 .
[21] J. Hiriart-Urruty,et al. Convex analysis and minimization algorithms , 1993 .
[22] R. Fletcher,et al. Resolving degeneracy in quadratic programming , 1993, Ann. Oper. Res..
[23] Claude Lemaréchal,et al. Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions , 1982, Math. Program..
[24] Nicholas I. M. Gould,et al. Convergence of quasi-Newton matrices generated by the symmetric rank one update , 1991, Math. Program..
[25] R. Tyrrell Rockafellar,et al. Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..
[26] Robert Mifflin. On superlinear convergence in univariate nonsmooth minimization , 1991, Math. Program..
[27] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[28] Richard H. Byrd,et al. A Theoretical and Experimental Study of the Symmetric Rank-One Update , 1993, SIAM J. Optim..
[29] C. Lemaréchal,et al. Practical aspects of the Moreau-Yosida regularization I : theoretical properties , 1994 .
[30] V. F. Dem'yanov,et al. Nondifferentiable Optimization , 1985 .
[31] Robert Mifflin. Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization , 1984, Math. Program..
[32] P. Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .
[33] Philip E. Gill,et al. Practical optimization , 1981 .
[34] C. Lemaréchal. Nondifferentiable optimization , 1989 .