On the absence of duality gap for Lagrange-type functions

DOI10.3934/jimo.2005.1.33zbMath1135.90428OpenAlexW2328414464WikidataQ58048592 ScholiaQ58048592MaRDI QIDQ1780341

Regina Sandra Burachik, Alexander Rubinov

Publication date: 7 June 2005

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2005.1.33

zbMATH Keywords

nonsmooth optimizationaugmented LagrangiansNonconvex programmingLagrange-type functions

Mathematics Subject Classification ID

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

Related Items

Non-monotone derivative-free algorithm for solving optimization models with linear constraints: extensions for solving nonlinearly constrained models via exact penalty methods ⋮ Duality and exact penalization for general augmented Lagrangians ⋮ An inexact modified subgradient algorithm for primal-dual problems via augmented Lagrangians ⋮ Augmented Lagrangian functions for constrained optimization problems ⋮ A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods ⋮ A Lagrange penalty reformulation method for constrained optimization ⋮ Unified nonlinear Lagrangian approach to duality and optimal paths ⋮ Exact augmented Lagrangian duality for mixed integer linear programming ⋮ Abstract convexity for nonconvex optimization duality ⋮ Extended duality for nonlinear programming ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ On primal convergence for augmented Lagrangian duality

This page was built for publication: On the absence of duality gap for Lagrange-type functions