The relaxation method for certain type of pseudoconvex programming problems
From MaRDI portal
(Redirected from Publication:1902802)
Recommendations
- Relaxation methods for minimization of pseudoconvex functions
- Relaxation algorithms for constrained minimization of nonsmooth strictly pseudoconvex functions
- scientific article; zbMATH DE number 447429
- Relaxation methods for strictly convex regularizations of piecewise linear programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- A relaxed version of Bregman's method for convex programming
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxation Methods for Linear Programs
- A relaxed extragradient-like method for a class of constrained optimization problem
Cited in
(9)- scientific article; zbMATH DE number 3987067 (Why is no real title available?)
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- scientific article; zbMATH DE number 4049403 (Why is no real title available?)
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- Relaxation algorithms for constrained minimization of nonsmooth strictly pseudoconvex functions
- scientific article; zbMATH DE number 3843085 (Why is no real title available?)
- Minimizing pseudoconvex functions on convex compact sets
- scientific article; zbMATH DE number 4139498 (Why is no real title available?)
This page was built for publication: The relaxation method for certain type of pseudoconvex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902802)
