A dual regularized method in convex finite-dimensional optimization problems
From MaRDI portal
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
Cited in
(15)- Duality and regularization for inf-sup problems
- scientific article; zbMATH DE number 4135720 (Why is no real title available?)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- Convergence results for a self-dual regularization of convex problems
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- A dual active set method for \(\ell1\)-regularized problem
- scientific article; zbMATH DE number 5524866 (Why is no real title available?)
- Regularized projection and conditional gradient methods in convex finite-dimensional optimization problems
- A dual regularized method for solving a class of convex minimization problems
- Modified dual scheme for finite-dimensional and infinite-dimensional convex optimization problems
- Regularized dual method for nonlinear mathematical programming
- scientific article; zbMATH DE number 4100438 (Why is no real title available?)
- scientific article; zbMATH DE number 6500912 (Why is no real title available?)
- scientific article; zbMATH DE number 1329073 (Why is no real title available?)
- On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints
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)
