نتایج جستجو برای: infeasible interior point method
تعداد نتایج: 2084016 فیلتر نتایج به سال:
A large-step infeasible-interior-point method is proposed for solving P∗(κ)-matrix linear complementarity problems. It is new even for monotone LCP. The algorithm generates points in a large neighborhood of an infeasible central path. Each iteration requires only one matrix factorization. If the problem is solvable, then the algorithm converges from arbitrary positive starting points. The compu...
We present an improved version of an infeasible interior-point method for linear optimization published in 2006. In the earlier version each iteration consisted of one so-called feasibility step and a few – at most three – centering steps. In this paper each iteration consists of only a feasibility step, whereas the iteration bound improves the earlier bound by a factor 2 √ 2. The improvements ...
In this paper we present an extension to SDP of the well known infeasible Interior Point method for linear programming of Kojima, Megiddo and Mizuno (A primal-dual infeasibleinterior-point algorithm for Linear Programming, Math. Progr., 1993). The extension developed here allows the use of inexact search directions; i.e., the linear systems defining the search directions can be solved with an a...
The paper is a simplified exposition of an early combined phase I-phase II method for linear programming. The method works from an infeasible start. Besides, there is no need for regularity conditions if the method is applied to a primal-dual formulation.
We propose a family of directions that generalizes many directions proposed so far in interiorpoint methods for the SDP (semide nite programming) and for the monotone SDLCP (semide nite linear complementarity problem). We derive the family from the Helmberg-Rendl-Vanderbei-Wolkowicz/KojimaShindoh-Hara/Monteiro direction by relaxing its \centrality equation" into a \centrality inequality." Using...
A simple interior point method is proposed for solving a system of linear equations subject to nonnegativity constraints. The direction of update is de ned by projection of the current solution on a linear manifold de ned by the equations. Infeasibility is discussed and extension for free and bounded variables is presented. As an application, we consider linear programming problems and a compar...
We present a generalization of a homogeneous self-dual linear programming (LP) algorithm to solving the monotone complementarity problem (MCP). The algorithm does not need to use any \big-M" parameter or two-phase method, and it generates either a solution converging towards feasibility and complementarity simultaneously or a certiicate proving infeasibility. Moreover, if the MCP is polynomiall...
An example of SDPs (semide nite programs) exhibits a substantial di culty in proving the superlinear convergence of a direct extension of the Mizuno-Todd-Ye type predictorcorrector primal-dual interior-point method for LPs (linear programs) to SDPs, and suggests that we need to force the generated sequence to converge to a solution tangentially to the central path (or trajectory). A Mizuno-Todd...
Some Jordan algebras were proved more than a decade ago to be an indispensable tool in the unified study of interior-point methods. By using it, we generalize the infeasible interiorpoint method for linear optimization of Roos [SIAM J. Optim., 16(4):1110–1136 (electronic), 2006] to symmetric optimization. This unifies the analysis for linear, second-order cone and semidefinite optimizations.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید