A choice of the regularization parameter in solving convex extremal problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4213343
- Regularization of extremal problems
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Exact Regularization of Convex Programs
- On the iterative prox-regularization in the case of solving extremal problems
- On the regularization method for conflicting problems of convex programming
- scientific article; zbMATH DE number 2206838
- scientific article; zbMATH DE number 4056420
- scientific article; zbMATH DE number 4094251
- scientific article; zbMATH DE number 19462
Cites work
- scientific article; zbMATH DE number 3168072 (Why is no real title available?)
- scientific article; zbMATH DE number 3658527 (Why is no real title available?)
- scientific article; zbMATH DE number 3454376 (Why is no real title available?)
- scientific article; zbMATH DE number 2206823 (Why is no real title available?)
- A continuous first-order regularization method for monotone variational inequalities in a Banach space
- A second-order continuous regularization method for nonlinear \(d\)-accretive equations in a Banach space
- How to approximate solutions of variational inequalities with monotone mappings in a Banach space if the data are known approximately
- On the moduli of convexity and smoothness
- Regularization methods for ill-posed inclusions and variational inequalities with domain perturbations
- Regularized continuous gradient projection method for minimization problems with inaccurate source data
Cited in
(8)- scientific article; zbMATH DE number 5679744 (Why is no real title available?)
- Regularization of extremal problems
- Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization
- A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
- scientific article; zbMATH DE number 3854323 (Why is no real title available?)
- Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
- On the regularization method for conflicting problems of convex programming
- Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems
This page was built for publication: A choice of the regularization parameter in solving convex extremal problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1975091)