The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions

DOI10.1007/S10255-006-0346-ZzbMath1119.90052OpenAlexW351715460MaRDI QIDQ871665

Wei Wang, Zun-Quan Xia, Li-Ping Pang

Publication date: 20 March 2007

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-006-0346-z

zbMATH Keywords

nonsmooth optimizationNonlinear programming\(\mathcal{U}\)-LagrangianD.C. functions

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (1)

A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions

Cites Work

• Extremal properties of the difference between convex functions
• Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
• The 𝒰-Lagrangian of a convex function
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions