In this paper,a class of polynomial interior-point algorithms for P_(∗)(κ)-horizontal linear complementarity problems based on a newparametric kernel function is presented.The new parametric kernel function is used b...In this paper,a class of polynomial interior-point algorithms for P_(∗)(κ)-horizontal linear complementarity problems based on a newparametric kernel function is presented.The new parametric kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center of the problem.We derive the complexity analysis for the algorithm,both with large and small updates.展开更多
The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the ...The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the products of the filled-in relay function induced by Coulomb friction and the absolute values of normal constraint reactions. With the time-stepping impulse-velocity scheme, the measure differential equations are discretized. The equations of horizontal linear complementarity problems (HLCPs), which are used to compute the impulses, are constructed by decomposing the absolute function and the filled-in relay function. These HLCP equations degenerate into equations of LCPs for frictional unilateral constraints, or HLCPs for frictional bilateral constraints. Finally, a numerical simulation for multibody systems with both unilateral and bilateral constraints is presented.展开更多
In this paper,we present a path-following infeasible interior-point method for P∗(κ)horizontal linear complementarity problems(P∗(κ)-HLCPs).The algorithm is based on a simple kernel function for finding the search d...In this paper,we present a path-following infeasible interior-point method for P∗(κ)horizontal linear complementarity problems(P∗(κ)-HLCPs).The algorithm is based on a simple kernel function for finding the search directions and defining the neighborhood of the central path.The algorithm follows the central path related to some perturbations of the original problem,using the so-called feasibility and centering steps,along with only full such steps.Therefore,it has the advantage that the calculation of the step sizes at each iteration is avoided.The complexity result shows that the full-Newton step infeasible interior-point algorithm based on the simple kernel function enjoys the best-known iteration complexity for P∗(κ)-HLCPs.展开更多
文摘In this paper,a class of polynomial interior-point algorithms for P_(∗)(κ)-horizontal linear complementarity problems based on a newparametric kernel function is presented.The new parametric kernel function is used both for determining the search directions and for measuring the distance between the given iterate and theμ-center of the problem.We derive the complexity analysis for the algorithm,both with large and small updates.
基金supported by the National Natural Science Foundation of China (10672007)
文摘The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the products of the filled-in relay function induced by Coulomb friction and the absolute values of normal constraint reactions. With the time-stepping impulse-velocity scheme, the measure differential equations are discretized. The equations of horizontal linear complementarity problems (HLCPs), which are used to compute the impulses, are constructed by decomposing the absolute function and the filled-in relay function. These HLCP equations degenerate into equations of LCPs for frictional unilateral constraints, or HLCPs for frictional bilateral constraints. Finally, a numerical simulation for multibody systems with both unilateral and bilateral constraints is presented.
文摘In this paper,we present a path-following infeasible interior-point method for P∗(κ)horizontal linear complementarity problems(P∗(κ)-HLCPs).The algorithm is based on a simple kernel function for finding the search directions and defining the neighborhood of the central path.The algorithm follows the central path related to some perturbations of the original problem,using the so-called feasibility and centering steps,along with only full such steps.Therefore,it has the advantage that the calculation of the step sizes at each iteration is avoided.The complexity result shows that the full-Newton step infeasible interior-point algorithm based on the simple kernel function enjoys the best-known iteration complexity for P∗(κ)-HLCPs.