On the convergence of the exponential multiplier method for convex programming
暂无分享,去创建一个
[1] A. Hoffman. On approximate solutions of systems of linear inequalities , 1952 .
[2] L. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .
[3] M. J. D. Powell,et al. Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .
[4] B. Martinet,et al. R'egularisation d''in'equations variationnelles par approximations successives , 1970 .
[5] D. Bertsekas,et al. A new penalty function method for constrained minimization , 1972, CDC 1972.
[6] S. M. Robinson. Bounds for error in the solution set of a perturbed linear program , 1973 .
[7] R. Tyrrell Rockafellar,et al. A dual approach to solving nonlinear programming problems by unconstrained optimization , 1973, Math. Program..
[8] Dimitri P. Bertsekas,et al. Necessary and sufficient conditions for a penalty method to be exact , 1975, Math. Program..
[9] D. Bertsekas. Newton's Method for Linear Optimal Control Problems* , 1976 .
[10] R. Rockafellar. Monotone Operators and the Proximal Point Algorithm , 1976 .
[11] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[12] J. Strodiot,et al. On the convergence rate for a penalty function method of exponential type , 1979 .
[13] E. G. Gol'shtein,et al. Modified Lagrangians in Convex Programming and their Generalizations , 1979 .
[14] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[15] D. Bertsekas,et al. Optimal short-term scheduling of large-scale power systems , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[16] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .
[17] D. Bertsekas,et al. Solution of Large-Scale Optimal Unit Commitment Problems , 1982, IEEE Transactions on Power Apparatus and Systems.
[18] C. Ha. A generalization of the proximal point algorithm , 1987, 26th IEEE Conference on Decision and Control.
[19] O. Mangasarian,et al. Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems , 1987 .
[20] Javier Luque. A nonlinear proximal point algorithm , 1987, 26th IEEE Conference on Decision and Control.
[21] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[22] Y. Censor,et al. Proximal minimization algorithm withD-functions , 1992 .
[23] Y. Censor,et al. On the proximal minimization algorithm with D-Functions , 1992 .
[24] Jonathan Eckstein,et al. Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..
[25] Marc Teboulle,et al. Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions , 1993, SIAM J. Optim..