Abstract
An approach to reducing a constrained convex programming problem to an unconstrained optimization problem is considered. An initial internal feasible point is supposed to be specified. An equivalent unconstrained optimization problem is formulated in such a way that the calculated values of gradients (subgradients) of original functions do not violate the initial constraints. Properties of introduced functions are investigated. Convexity conditions are formulated for the unconstrained optimization problem. The results may by useful for the development of algorithms for solving constrained optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have