A dual regularized method for solving a class of convex minimization problems

MaRDI QIDQ5954719zbMATH OpenFDO

Authors A. Z. Ishmukhametov

Publication date 28 October 2002

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

zbMATH Keywords

approximate solutionconvergenceconvex infinite dimensional minimization problemsHilbert spaceinequality constraintsregularization methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming in abstract spaces (90C48)

Recommendations

• A dual regularized method in convex finite-dimensional optimization problems
• scientific article; zbMATH DE number 2210664
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• scientific article; zbMATH DE number 3847229
• Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems

Cited in

(26)

• A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems
• A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space
• On the regularization method for conflicting problems of convex programming
• Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
• A control for a rotor with a cavity containing an ideal liquid, II
• A dual Bregman proximal gradient method for relatively-strongly convex optimization
• Convergence results for a self-dual regularization of convex problems
• scientific article; zbMATH DE number 6500912 (Why is no real title available?)
• scientific article; zbMATH DE number 3847229 (Why is no real title available?)
• scientific article; zbMATH DE number 4135720 (Why is no real title available?)
• scientific article; zbMATH DE number 4142758 (Why is no real title available?)
• Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems
• A dual regularized method in convex finite-dimensional optimization problems
• scientific article; zbMATH DE number 5524866 (Why is no real title available?)
• scientific article; zbMATH DE number 1329073 (Why is no real title available?)
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• Tubularity and Asymptotic Convergence of Penalty Trajectories in Convex Programming
• scientific article; zbMATH DE number 895357 (Why is no real title available?)
• Duality-based regularization in a linear convex mathematical programming problem
• Regularized dual method for nonlinear mathematical programming
• Path-following Methods for a Class of Constrained Minimization Problems in Function Space
• scientific article; zbMATH DE number 2210664 (Why is no real title available?)
• Minimization of energy functionals applied to some inverse problems
• A dual active set method for \(\ell1\)-regularized problem
• On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints
• Simplication of dual extremal problems invariant with respect to change in variables

This page was built for publication: A dual regularized method for solving a class of convex minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954719)