On the regularization method for conflicting problems of convex programming
From MaRDI portal
Recommendations
- Publication:3035145
- Exact Regularization of Convex Programs
- Publication:3468887
- On the application of the regularization method for the correction of improper problems of convex programming
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Regularized optimization methods for convex MINLP problems
- On a method of iterative regularization for convex minimization problems
- A choice of the regularization parameter in solving convex extremal problems
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- A dual regularized method for solving a class of convex minimization problems
Cited in
(9)- On the construction of regularizing algorithms for the correction of improper convex programming problems
- Convergence results for a self-dual regularization of convex problems
- Duality and correction of inconsistent constraints for improper linear programming problems
- A choice of the regularization parameter in solving convex extremal problems
- scientific article; zbMATH DE number 3956825 (Why is no real title available?)
- scientific article; zbMATH DE number 4133838 (Why is no real title available?)
- On the application of the regularization method for the correction of improper problems of convex programming
- Lexicographic regularization and duality for improper linear programming problems
- On the application of the residual method for the correction of inconsistent problems of convex programming
This page was built for publication: On the regularization method for conflicting problems of convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380199)
