Research Article
Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones
Algorithm 1
Original constraint consensus algorithm.
| INPUTS: set of q constraints (1.1), an initial point , a feasibility distance tolerance , | | a movement tolerance , maximum number of iterations . | | while steps do | | , for all , | | for every constraint do | | if constraint is violated then | | Calculate feasibility vector and feasibility distance | | if then | | | | for every variable do | | , | | If then | | exit successfully | | for every variable : do | | if then | | | | else | | | | if then | | exit unsuccessfully | | , steps = steps + 1 |
|
