Abstract
A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Chen and M. Teboulle “Convergence analysis of a proximal like minimization algorithm using Bregman functions”, Department of Mathematics, University of Maryland, Baltimore, MD, TR-90-23, 1990.
J. Eckstein and D.P. Bertsekas, “On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators”, Harvard Business School Boston, MA, Working Paper 90-033, 1989.
R. Fletcher, Practical Methods for Optimization, Second Edition. John Wiley & Sons: Chichester, England, 1987.
C.D. Ha, “A generalization of the proximal point algorithm”, SIAM J. on Control and Optimization, vol. 28, pp. 503–512, 1990.
W.W. Hager and D.W. Hearn, “The dual active set algorithm and quadratic networks” Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, Research Report No. 90-7, 1990.
M.R. Hestenes, Conjugate Direction Methods in Optimization, Springer-Verlag: New York, NY, 1980.
S. Ibaraki, M. Fukashima, and T. Ibaraki, “Dual-based Newton method for nonlinear minimum cost network flow problems”, J. of the Operations Research Society of Japan, vol. 34, pp. 263–286, 1991.
D. Klingman, A. Napier, and J. Stutz, “NETGEN: A program for generating large scale capacitated assignment, transportation and minimum cost flow network problems”, Management Sci., vol. 20, pp. 814–822, 1974.
E.J. Luque, “Asymptotic convergence analysis of the proximal point algorithms” SIAM J. on Control and Optimization, vol. 22, pp. 277–293, 1984.
E.J. Luque, “A nonlinear proximal point algorithm”, Proc. of the 26th IEEE Con. on Decision and Control, Los Angeles, CA, pp. 816–817. 1987.
R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970.
R.T. Rockafellar, “Monotone operators and the proximal point algorithm”, SIAM J. on Control and Optimization, vol. 14, pp. 877–898, 1976.
R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming”, Math. of Oper. Res., vol. 1, pp. 97–116, 1976.
R.T. Rockafellar, “Monotone operators and augmented Lagrangian methods in nonlinear programming”, in Nonlinear Programming 3 (O.L. Mangasarian et al., eds.), Academic Press: New York, NY, pp. 1–25, 1976.
J.E. Spingarn, “Partial inverse of a monotone operator”, App. Math. and Optimization, vol. 10, pp. 247–265, 1983.
M. Teboulle, “Entropic proximal mappings with applications to nonlinear programming”, Department of Mathematics, University of Maryland, Baltimore, MD, TR-9-15, 1990.
S.J. Wright, “Implementing proximal point methods for linear programming”, J. of Optimization Theory and Applications, vol. 65, pp. 531–554, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ibaraki, S., Fukushima, M. & Ibaraki, T. Primal-dual proximal point algorithm for linearly constrained convex programming problems. Comput Optim Applic 1, 207–226 (1992). https://doi.org/10.1007/BF00253807
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00253807