A choice of the regularization parameter in solving convex extremal problems

DOI10.1134/S0965542506070037MaRDI QIDQ1975091zbMATH OpenOpenAlexFDO

Authors I. P. Ryazantseva

Publication date 5 April 2000

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0965542506070037

zbMATH Keywords

generalized-residual principle

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Variational problems concerning extremal problems in several variables; Yang-Mills functionals (58E15) Convex programming (90C25)

Review text

The ill-posed problem of the minimization of a convex functional that is not uniformly convex is ill-posed is considered. The author uses a smoothing-functional method for solving this problem, which is based on the generalized residual principles. The aim this work is the construction of a generalized residual principle of a new form, which is based on another data. Such a problem arises from the fact that even for convex minimized functionals, one has to solve the problems of nonconvex minimization when using the above mentioned method. This sometimes presents unsurmountable difficulties in numerically implementing the method.

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

• 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
• 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?)
• 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)

• On the regularization method for conflicting problems of convex programming
• Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization
• Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
• scientific article; zbMATH DE number 3854323 (Why is no real title available?)
• Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems
• scientific article; zbMATH DE number 5679744 (Why is no real title available?)
• A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems
• Regularization of extremal 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)