The relaxation method for certain type of pseudoconvex programming problems

zbMATH Open0838.90108MaRDI QIDQ1902802FDOQ1902802

Ya. I. Zabotina, Z. R. Gabidullina

Publication date: 17 December 1995

Published in: Russian Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

pseudoconvex function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (9)

• 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
• Title not available (Why is that?)
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
• Relaxation algorithms for constrained minimization of nonsmooth strictly pseudoconvex functions
• Title not available (Why is that?)
• Minimizing pseudoconvex functions on convex compact sets
• Title not available (Why is that?)
• Title not available (Why is that?)

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)