An approximate \(\mathcal U\)-Lagrangian and algorithm to \(\mathcal{UV}\) decomposition

DOI10.1016/j.amc.2006.05.191zbMath1119.65055OpenAlexW1583281701MaRDI QIDQ879572

Feng Shan, Zun-Quan Xia, Li-Ping Pang

Publication date: 14 May 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.191

zbMATH Keywords

algorithmconvergencenonsmooth optimizationsubdifferentialnonlinear programmingunconstrained minimization\(\mathcal U\)-Lagrangian\(\mathcal{UV}\)-decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

An approximate decomposition algorithm for convex minimization

Cites Work

• The 𝒰-Lagrangian of a convex function
• A proximal bundle method based on approximate subgradients
• Unnamed Item
• Unnamed Item
• Unnamed Item