Two-phase method in affine scaling algorithm for linear programming optimization
نویسندگان
چکیده
منابع مشابه
An Affine-scaling Pivot Algorithm for Linear Programming
We proposed a pivot algorithm using the affine-scaling technique. It produces a sequence of interior points as well as a sequence of vertices, until reaching an optimal vertex. We report preliminary but favorable computational results obtained with a dense implementation of it on a set of standard Netlib test problems.
متن کاملAffine scaling algorithm fails for semidefinite programming
In this paper, we introduce an aane scaling algorithm for semideenite programming, and give an example of a semideenite program such that the aane scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions, and unique optimal solutions which satisfy strict complementarity, and they are nondegenerate everywhere. Abbreviated Title: AAne scal...
متن کاملAn Affine Scaling Trust Region Algorithm for Nonlinear Programming
A monotonic decrease minimization algorithm can be desirable for nonconvex minimization since there may be more than one local minimizers. A typical interior point algorithm for a convex programming problem does not yield monotonic improvement of the objective function value. In this paper, a monotonic affine scaling trust region algorithm is proposed for nonconvex programming. The proposed aff...
متن کاملAn O(root(n)L) iteration bound primal-dual cone affine scaling algorithm for linear programming
In this paper we introduce a primal-dual affine scaling method. The method uses a search-direction obtained by minimizing the duality gap over a linearly transformed conic section. This direction neither coincides with known primal-dual affine scaling directions (Jansen et al., 1993; Monteiro et al., 1990), nor does it fit in the generic primal-dual method (Kojima et al., 1989). The new method ...
متن کاملAn O(√nL) Iteration Bound Primal-Dual Cone Affine Scaling Algorithm for Linear Programming
In this paper we introduce a primal-dual affine scaling method. The method uses a searchdirection obtained by minimizing the duality gap over a linearly transformed conic section. This direction neither coincides with known primal-dual affine scaling directions [12, 21], nor does it fit in the generic primal-dual method [15]. The new method requires O(√nL) main iterations. It is shown that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1836/1/012028