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: | Anna Weigandt, Kaitlyn Tuthill, Shafiu Jibrin |
---|---|
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!
|
Similar Items
-
An Interior Point Method for Solving Semidefinite Programs Using Cutting Planes and Weighted Analytic Centers
by: John Machacek, et al.
Published: (2012-01-01) -
Exact Interior Reconstruction with Cone-Beam CT
by: Yangbo Ye, et al.
Published: (2007-01-01) -
On Analog of Fourier Transform in Interior of the Light Cone
by: Tatyana Shtepina
Published: (2014-01-01) -
Computing Weighted Analytic Center for Linear Matrix Inequalities Using Infeasible Newton’s Method
by: Shafiu Jibrin
Published: (2015-01-01) -
Consensus of Discrete Time Second-Order Multiagent Systems with Time Delay
by: Wei Zhu
Published: (2012-01-01)