Abstract
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a separation result for nonconvex sets via general concave surfaces. We use this separation result to provide necessary and sufficient conditions for establishing strong duality between geometric primal and dual problems. Using the primal function of a constrained optimization problem, we apply our results both in the analysis of duality schemes constructed using augmented Lagrangian functions, and in establishing necessary and sufficient conditions for the convergence of penalty methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Auslender A., Cominetti R. and Haddou M. (1997). Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22(1): 43–62
Auslender A. and Teboulle M. (2003). Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer-Verlag, New York
Bertsekas D.P., Nedić A. and Ozdaglar A. (2003). Convex Analysis and Optimization. Athena Scientific, Belmont, MA
Bertsekas D.P., Nedić A., Ozdaglar A.: Min common/max crossing duality: a simple geometric framework for convex optimization and minimax theory. Report LIDS-P-2536 (2002)
Bertsekas D.P. (1999). Nonlinear Programming. Athena Scientific, Belmont, MA
Bonnans J.F. and Shapiro A. (2000). Perturbation Analysis of Optimization Problems. Springer-Verlag, New York, NY
Borwein J.M. and Lewis A.S. (2000). Convex Analysis and Nonlinear Optimization. Springer-Verlag, New York, NY
Hiriart-Urruty J.-B. and Lemarechal C. (1993). Convex Analysis and Minimization Algorithms, vols I and II. Springer-Verlag, Berlin, NY
Huang X.X. and Yang X.Q. (2003). A unified augmented Lagrangian approach to duality and exact penalization. Math. Oper. Res. 28(3): 533–552
Luenberger D.G. (2004). Linear and Nonlinear Programming, 2nd edn. Kluwer Academic Publishers, MA
Polyak B.T. (1987). Introduction to Optimization. Optimization Software Inc., NY
Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton NJ
Rockafellar R.T. and Wets R.J.-B. (1998). Variational Analysis. Springer-Verlag, New York
Rubinov A.M., Huang X.X. and Yang X.Q. (2002). The zero duality gap property and lower semicontinuity of the perturbation function. Math. Oper. Res. 27(4): 775–791
Rubinov A.M. (2000). Abstract Convexity and Global Optimization. Kluwer Academic Publishers, Dordrecht
Rubinov A.M. and Yang X.Q. (2003). Lagrange-type Functions in Constrained Nonconvex Optimization. Kluwer Academic Publishers, MA
Tseng P. and Bertsekas D.P. (1993). On the convergence of the exponential multiplier method for convex programming. Math. Program. 60: 1–19
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nedich, A., Ozdaglar, A. A geometric framework for nonconvex optimization duality using augmented lagrangian functions. J Glob Optim 40, 545–573 (2008). https://doi.org/10.1007/s10898-006-9122-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-006-9122-0