Online convex optimization with time-varying constraints

Constraint optimization, or constraint programming (CP), is the name given to identifying feasible solutions out of a very large set of candidates, where the problem can be modeled in terms of arbitrary constraints.
CP problems arise in many scientific and engineering disciplines.

How to solve convex optimization with linear equality constraints?

Finally, convex optimization with both linear equality constraints and convex inequality constraints can be solved by applying an unconstrained convex optimization technique to the objective function plus logarithmic barrierterms

(

What is Online convex optimization problem with time-varying constraints?

Abstract: In this paper, online convex optimization problem with time-varying constraints is studied from the perspective of an agent taking sequential actions

Both the objective function and the constraint functions are dynamic and unknown a priori to the agent

Categories