A geometric framework for nonconvex optimization duality using augmented Lagrangian functions

DOI10.1007/s10898-006-9122-0zbMath1149.90179OpenAlexW2031363992MaRDI QIDQ2481369

Angelia Nedić, Asuman Ozdaglar

Publication date: 9 April 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9122-0

zbMATH Keywords

strong dualityweak dualitypenalty methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items

Duality and exact penalization for general augmented Lagrangians, Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization, Exact augmented Lagrangian duality for mixed integer linear programming, Extended duality for nonlinear programming, A new augmented Lagrangian approach to duality and exact penalization, Divide to conquer: decomposition methods for energy optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence of the exponential multiplier method for convex programming
• Pricing a nontradeable asset and its derivatives.
• Lagrange-type functions in constrained non-convex optimization.
• Convex analysis and nonlinear optimization. Theory and examples
• Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
• Variational Analysis
• Convex Analysis
• The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
• Abstract convexity and global optimization