Abstract
For optimization problems with computationally demanding objective functions and subgradients, inexact subgradient methods (IXS) have been introduced by using successive approximation schemes within subgradient optimization methods (Au et al., 1994). In this paper, we develop alternative solution procedures when the primal-dual information of IXS is utilized. This approach is especially useful when the projection operation onto the feasible set is difficult. We also demonstrate its applicability to stochastic linear programs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K.T. Au, J.L. Higle and S. Sen, “Inexact subgradient methods with applications in stochastic programming,”Mathematical Programming 63 (1994) 65–82.
J.R. Birge and R.J-B. Wets, “Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse,”Mathematical Programming Study 27 (1986) 54–102.
G.B. Dantzig and P.W. Glynn, “Parallel processors for planning under uncertainty”,The Annals of Operations Research 22 (1990) 1–21.
Y. Ermoliev, “Stochastic quasigradient methods,” in: Y. Ermoliev and R.J-B. Wets eds.,Numerical Techniques for Stochastic Optimization (Springer, Berlin, 1988) pp. 141–185.
K. Frauendorfer, “Solving SLP recourse problems with arbitrary multivariate distributions—the dependent case,”Mathematics of Operations Research 13 (1988) 377–394.
A.A. Gaivoronski, “Approximation methods of solution of stochastic programming problems,”Cybernetics 18 (1982) 241–249.
A.A. Gaivoronski, “Implementation of stochastic quasigradient methods,” in: Y. Ermoliev and R.J-B. Wets, eds.,Numerical Techniques for Stochastic Optimization (Springer, Berlin, 1988) pp. 313–351.
A.A. Gaivoronski A. Golonikov and L.D. Fung, “Solution of limiting extremal problems for minimizing functional,”Cybernetics 16 (1980) 97–103.
S. Garska and D. Rutenberg, “Computation in discrete stochastic programs with recourse,”Operations Research 21 (1973) 112–122.
J.L. Higle and S. Sen, “Stochastic Decomposition: An algorithm for two-stage linear programs with recourse”Mathematics of Operations Research 16 (1991a) 650–669.
J.L. Higle and S. Sen, “Statistical verification of optimality conditions for stochastic programs with recourse,”Annals of Operations Research 30 (1991b) 215–240.
P. Kall, “Approximation to optimization problems: an elementary review”,Mathematics of Operations Research 11 (1986) 9–18.
A.J. King and R.J.-B. Wets, “Epi-consistency of convex stochastic programs,”Stochastics and Stochastics Reports 34 (1991) 83–91.
R.T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,”Mathematics of Operations Research 1 (1976) 97–116.
R.T. Rockafellar and R.J-B. Wets, “A note about projections in the implementation of stochastic quasigradient methods,” in: Y. Ermoliev and R.J-B. Wets, eds.,Numerical Techniques for Stochastic Optimization (Springer, Berlin, 1988) pp. 385–392.
S. Sen and H.D. Sherali, “A class of convergent primal-dual subgradient algorithms for decomposable convex programs,”Mathematical Programming 35 (1986) 279–297.
N.Z. Shor.Minimization Methods for Nondifferentiable Functions (Springer, Berlin, 1985).
R.J-B. Wets, “Stochastic programming solution techniques and approximation schemes,” in: A. Bachem, M. Groetschel and B. Korte, eds.,Mathematical Programming: The State of the Art 1982 (Springer, Berlin, 1982) pp. 566–603.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Au, K.T. A primal-dual approach to inexact subgradient methods. Mathematical Programming 72, 259–272 (1996). https://doi.org/10.1007/BF02592092
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592092