Lagrangian regularization approach to constrained optimization problems (Q703420): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:57, 30 January 2024

scientific article
Language Label Description Also known as
English
Lagrangian regularization approach to constrained optimization problems
scientific article

    Statements

    Lagrangian regularization approach to constrained optimization problems (English)
    0 references
    0 references
    0 references
    11 January 2005
    0 references
    This paper proposes a new regularization approach, referred to as the Lagrangian regularization approach, which aims to circumvent the nondifferentiability of a positively homogeneous function \(\delta(\cdot|\mathbb{R}^M_-\) in a conceptual unconstrained reformulation for constrained optimization problems. With the appropriate choices of regularizing function, we obtain a family of smooth functions that include, as special cases, the existing penalty and barrier functions. As such, our approach can be used as an instrumental tool to resolve the nondifferentiability of \(\delta(\cdot|\mathbb{R}^M_-\) as well as a unified way to construct penalty functions. For convex programming cases, we present its global convergence analysis.
    0 references
    Constrained optimization problem
    0 references
    Regularization approach
    0 references
    Penalty function
    0 references
    Monotone conjugate
    0 references
    Recession function
    0 references

    Identifiers