Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems

zbMATH Open1154.90622MaRDI QIDQ3596900FDOQ3596900

Authors: A. S. Esenkov, Yu. G. Karyukina, A. Z. Ishmukhametov 

Publication date: 9 February 2009

Recommendations

• scientific article; zbMATH DE number 2210664
• A dual regularized method in convex finite-dimensional optimization problems
• Regularized optimization methods with finite-step interior algorithms
• A dual regularized method for solving a class of convex minimization problems
• Gradient methods with regularization for constrained optimization problems and their complexity estimates

Mathematics Subject Classification ID

Convex programming (90C25) Methods of reduced gradient type (90C52)

Cited In (9)

• Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
• A dual regularized method in convex finite-dimensional optimization problems
• Finite-dimensional optimality conditions: B-gradients
• Title not available (Why is that?)
• Title not available (Why is that?)
• A dual regularized method for solving a class of convex minimization problems
• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints
• Gradient methods with regularization for constrained optimization problems and their complexity estimates

This page was built for publication: Regularized projection and conditional gradient methods 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 Q3596900)