Approximation and regularization properties of augmented penalty functions in convex programming
DOI10.1134/S0081543810060222zbMATH Open1236.90091MaRDI QIDQ643780FDOQ643780
Authors: V. D. Skarin
Publication date: 2 November 2011
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Recommendations
- Penalty function method and regularization in the analysis of improper convex programs
- scientific article; zbMATH DE number 4092678
- scientific article; zbMATH DE number 1440126
- Strict convex regularizations, proximal points and augmented lagrangians
- Duality and penalization in optimization via an augmented Lagrangian function with applications
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- scientific article; zbMATH DE number 4045496
- An augumented penalty function method for solving a class of variational inequalities
- Application of the penalty function method to generalized convex programs
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs
regularization methodconvergence conditionsoptimal correctionimproper problemaugmented penalty functionsill-posed convex programming problems
Convex programming (90C25) Ill-posedness and regularization problems in numerical linear algebra (65F22) Nonlinear ill-posed problems (47J06) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Cites Work
Cited In (4)
This page was built for publication: Approximation and regularization properties of augmented penalty functions in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643780)