Consider the problem of minimizing a smooth convex functionfsubject to the constraintsAx=bandx≥0, whereA∈ℝp×n. This constrained optimization problem is shown to be equivalent to a differentiable unconstrained optimization problem with 2n+pvariables. This formulation of the convex constrained optimization problem can be of great advantage ifnandpare large. Some preliminary numerical results are re
展开▼
