Abstract convexity for nonconvex optimization duality

DOI10.1080/02331930701617379zbMath1172.90465MaRDI QIDQ5426967

Asuman Ozdaglar, Angelia Nedić, Alexander Rubinov

Publication date: 16 November 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701617379

zbMATH Keywords

Duality; Nonconvex optimization; Abstract convexity; Augmenting functions

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

49N15: Duality theory (optimization)

Related Items

On ℋ_n+1-convex functions: asymptotic behaviour and subdifferentials, Zero duality gap conditions via abstract convexity, Duality and exact penalization for general augmented Lagrangians, Radiant separation theorems and minimum-type subdifferentials of calm functions, Revisiting augmented Lagrangian duals, Global optimization of the difference of two increasing plus-convex-along-rays functions, A primal dual modified subgradient algorithm with sharp Lagrangian

Cites Work

• Unnamed Item
• Unnamed Item
• Modified barrier functions (theory and methods)
• On the absence of duality gap for Lagrange-type functions
• Abstract Convexity and Augmented Lagrangians
• Variational Analysis
• Decreasing Functions with Applications to Penalization
• The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization