We present a general framework whereby analysis of interior-point algorithms for semidefinite programming can be extended verbatim to optimization problems over all classes of symmetric cones ...
Mathematics of Computation, Vol. 69, No. 229 (Jan., 2000), pp. 283-304 (22 pages) Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood ...
Interior-point methods constitute a robust class of algorithms for solving constrained optimisation problems by exploring the interior of the feasible region instead of traversing its boundary. These ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback