Abstract convexity for nonconvex optimization duality

DOI10.1080/02331930701617379zbMath1172.90465OpenAlexW2043642089MaRDI 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

DualityNonconvex optimizationAbstract convexityAugmenting functions

Mathematics Subject Classification ID

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

Related Items (7)

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

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

This page was built for publication: Abstract convexity for nonconvex optimization duality