Lagrangian regularization approach to constrained optimization problems (Q703420): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.na.2004.08.001 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084514070 / rank | |||
Normal rank |
Revision as of 23:10, 19 March 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
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