An equality-constrained convex optimization problem has the form
(1)
where is convex and the constraint is affine. Its stationarity and feasibility equations can be combined into a monotone primal-dual operator.

Ancestors (5)

  1. Convex optimization
  2. Mathematical optimization
  3. Area of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version