The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions (Q871665): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4375488 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4762480 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 𝒰-Lagrangian of a convex function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4338510 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal properties of the difference between convex functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4936843 / rank | |||
Normal rank |
Latest revision as of 15:10, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions |
scientific article |
Statements
The \(\mathcal{UV}\)-decomposition on a class of d.c. functions and optimality conditions (English)
0 references
20 March 2007
0 references
From the point of view of optimization, the first and second order expansions are mainly used for studying some optimality conditions and constructing algorithms. In this paper, the authors use \(\mathcal{U}\mathcal{V}\)-theory and \(\text{P}\)-differential calculus to study second order expansion of a class of D.C. functions and minimization problems. A \(\mathcal{U}\)-Lagrangian of this function is presented and some properties are given. The authors also present some necessary optimality conditions for a class of constrained D.C. minimization with linear constraints.
0 references
Nonlinear programming
0 references
D.C. functions
0 references
\(\mathcal{U}\)-Lagrangian
0 references
nonsmooth optimization
0 references