The monotone variational inequalities VI(Ω, F) have vast applications, including optimal controls and convex programming. In this paper we focus on the VI problems that have a particular splitting structure and in ...The monotone variational inequalities VI(Ω, F) have vast applications, including optimal controls and convex programming. In this paper we focus on the VI problems that have a particular splitting structure and in which the mapping F does not have an explicit form, therefore only its function values can be employed in the numerical methods for solving such problems. We study a set of numerical methods that are easily implementable. Each iteration of the proposed methods consists of two procedures. The first (prediction) procedure utilizes alternating projections to produce a predictor. The second (correction) procedure generates the new iterate via some minor computations. Convergence of the proposed methods is proved under mild conditions. Preliminary numerical experiments for some traffic equilibrium problems illustrate the effectiveness of the proposed methods.展开更多
To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system ...To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system of nonlinear equations (LQP system). This paper presents a practical LQP method-based prediction-correction method for NCP. The predictor is obtained via solving the LQP system approximately under significantly relaxed restriction, and the new iterate (the corrector) is computed directly by an explicit formula derived from the original LQP method. The implementations are very easy to be carried out. Global convergence of the method is proved under the same mild assumptions as the original LQP method. Finally, numerical results for traffic equilibrium problems are provided to verify that the method is effective for some practical problems.展开更多
In this paper, we consider the solution of the standard linear programming [Lt'). A remarkable result in LP claims that all optimal solutions form an optimal face of the underlying polyhedron. In practice, many real...In this paper, we consider the solution of the standard linear programming [Lt'). A remarkable result in LP claims that all optimal solutions form an optimal face of the underlying polyhedron. In practice, many real-world problems have infinitely many optimal solutions and pursuing the optimal face, not just an optimal vertex, is quite desirable. The face algorithm proposed by Pan [19] targets at the optimal face by iterating from face to face, along an orthogonal projection of the negative objective gradient onto a relevant null space. The algorithm exhibits a favorable numerical performance by comparing the simplex method. In this paper, we further investigate the face algorithm by proposing an improved implementation. In exact arithmetic computation, the new algorithm generates the same sequence as Pan's face algorithm, but uses less computational costs per iteration, and enjoys favorable properties for sparse problems.展开更多
文摘The monotone variational inequalities VI(Ω, F) have vast applications, including optimal controls and convex programming. In this paper we focus on the VI problems that have a particular splitting structure and in which the mapping F does not have an explicit form, therefore only its function values can be employed in the numerical methods for solving such problems. We study a set of numerical methods that are easily implementable. Each iteration of the proposed methods consists of two procedures. The first (prediction) procedure utilizes alternating projections to produce a predictor. The second (correction) procedure generates the new iterate via some minor computations. Convergence of the proposed methods is proved under mild conditions. Preliminary numerical experiments for some traffic equilibrium problems illustrate the effectiveness of the proposed methods.
文摘To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system of nonlinear equations (LQP system). This paper presents a practical LQP method-based prediction-correction method for NCP. The predictor is obtained via solving the LQP system approximately under significantly relaxed restriction, and the new iterate (the corrector) is computed directly by an explicit formula derived from the original LQP method. The implementations are very easy to be carried out. Global convergence of the method is proved under the same mild assumptions as the original LQP method. Finally, numerical results for traffic equilibrium problems are provided to verify that the method is effective for some practical problems.
文摘In this paper, we consider the solution of the standard linear programming [Lt'). A remarkable result in LP claims that all optimal solutions form an optimal face of the underlying polyhedron. In practice, many real-world problems have infinitely many optimal solutions and pursuing the optimal face, not just an optimal vertex, is quite desirable. The face algorithm proposed by Pan [19] targets at the optimal face by iterating from face to face, along an orthogonal projection of the negative objective gradient onto a relevant null space. The algorithm exhibits a favorable numerical performance by comparing the simplex method. In this paper, we further investigate the face algorithm by proposing an improved implementation. In exact arithmetic computation, the new algorithm generates the same sequence as Pan's face algorithm, but uses less computational costs per iteration, and enjoys favorable properties for sparse problems.