A dual regularized method in convex finite-dimensional optimization problems

zbMATH Open1154.90565MaRDI QIDQ3596902FDOQ3596902

I. P. Antipin, Yu. G. Karyukina, A. Z. Ishmukhametov

Publication date: 9 February 2009

Recommendations

• Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems
• A dual regularized method for solving a class of convex minimization problems
• Regularized optimization methods with finite-step interior algorithms
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• Publication:3468887

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Cited In (12)

• Title not available (Why is that?)
• Duality and regularization for inf-sup problems
• \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
• Certification aspects of the fast gradient method for solving the dual of parametric convex programs
• A dual active set method for \(\ell1\)-regularized problem
• Title not available (Why is that?)
• Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems
• A dual regularized method for solving a class of convex minimization problems
• Regularized dual method for nonlinear mathematical programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A dual regularized method in convex finite-dimensional optimization problems

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