Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones
Optimization problems with second-order cone constraints (SOCs) can be solved efficiently by interior point methods. In order for some of these methods to get started or to converge faster, it is important to have an initial feasible point or near-feasible point. In this paper, we study and apply Ch...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2010-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2010/307209 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Optimization problems with second-order cone constraints (SOCs) can be solved efficiently
by interior point methods. In order for some of these methods to get started or
to converge faster, it is important to have an initial feasible point or near-feasible point.
In this paper, we study and apply Chinneck's Original constraint consensus method and
DBmax constraint consensus method to find near-feasible points for systems of SOCs.
We also develop and implement a new backtracking-like line search technique on these
methods that attempts to increase the length of the consensus vector, at each iteration,
with the goal of finding interior feasible points. Our numerical results indicate that the
new methods are effective in finding interior feasible points for SOCs. |
|---|---|
| ISSN: | 1110-757X 1687-0042 |