| Abstract: | A mathematical programming problem is said to have separated nonconvex variables when the variables can be divided into two groups: x=(x1,...,xn) and y=( y1,...,yn), such that the objective function and any constraint function is a sum of a convex function of (x, y) jointly and a nonconvex function of x alone. A method is proposed for solving a class of such problems which includes Lipschitz optimization, reverse convex programming problems and also more general nonconvex optimization problems. |
